The depth of a node is the number of edges from root to that node, right? But how to find it by a method like findDepth(Node node) in java?
-
2Does this answer your question? Finding height in Binary Search TreeArvind Kumar Avinash– Arvind Kumar Avinash2020-04-07 13:15:07 +00:00Commented Apr 7, 2020 at 13:15
Add a comment
|
2 Answers
It's a simple exercise on recursion. Implement it recursively.
findDepth(Node node)
In the code of the findDepth function/method do this:
1) if the node has a parent return 1 + findDepth(parent)
2) if the node has no parent (i.e. is the root) return 0
Comments
So, based on this answer, already on stackOverflow, you can do this:
int findDepth(Node node) {
if (aNode == null) {
return -1;
}
int lefth = findHeight(node.left);
int righth = findHeight(node.right);
if (lefth > righth) {
return lefth + 1;
} else {
return righth + 1;
}
}
