倾斜二叉树
1）不平衡二叉树一词的含义是什么以及我们如何编写算法来测试它？
2）我有一个问题，要求编写一个函数来测试二叉树的深度。我认为这会起作用，但不确定......：
function getDepth(Node n){
if(node == null){
return 0;
}
return 1 + Math.max(getDepth(node.left), getDepth(node.right));
}
getDepth(root);
任何人都可以给我指点......
1) What is meant by the term unbalanced binary tree and how we can write an algorithm to test it?
2) I have a problem which asks to write a function to test the depth of a binary tree. I think this would work but not sure....:
function getDepth(Node n){
if(node == null){
return 0;
}
return 1 + Math.max(getDepth(node.left), getDepth(node.right));
}
getDepth(root);
Can anyone give me pointers...
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
1) 倾斜二叉树并不是一个 100% 广泛使用的通用术语（甚至 Google 也会感到困惑）。搜索您的讲义或书籍，看看它们的含义。要测试一棵树是否具有与节点一样多的级别，您可以只使用已有的计算级别的函数和另一个计算级别的函数节点数量。
但是，您应该制作另一种更有效的算法，如果发现节点数不能与级别数相同，则该算法会提前终止。
深度函数正确。毕竟，这不是直接从树深度的定义中得出的吗？
（唯一可能的挑剔是深度（null）= 1。只需确保您不需要深度（null）= 0）
1) Skew binary tree is not a 100% widespread common term (even Google gets confused). Search your lecture notes or book to see what they mean with it.To test is a tree has as many leves as nodes, you could just use the function you already have that counts levels and another function to count the number of nodes.
However, you should be abe to make another, more efficient, algorithm that terminates earlier if if finds that the number of nodes cannot be the same as the number of levels.
The depth function is correct. After all, isn't this taken straight from the definition of tree depth?
(the only possible nitpick is the depth(null) = 1. Just be sure you don't need depth(null) = 0 instead)
倾斜二叉树是只有一种子树的树。如果一棵树只有左子树，那么它是左偏树，反之亦然。
Skewed Binary tree is the tree which has only one type of sub trees. If a tree has only left sub trees then it is left skewed tree and vice versa.