### Possible Answer

The difference between them is that in one case you count number of nodes and in other number of edges on the shortest path between root and concrete . java - Height of a binary tree - Stack Overflow Difference between binary tree and binary search... Finding height in Binary Search Tree - Stack... - read more

What is the difference between depth and height (binary trees)? ... But the teacher wrote that the depth of a complete tree is height minus one, ... - read more

Please vote if the answer you were given helped you or not, thats the best way to improve our algorithm. You can also submit an answer or search documents about difference between height and depth of a binary search tree.