### 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 algorithm - Depth vs Height of a tree. Refreshing... The best way to calculate the height in a binary ... Finding height in Binary Search Tree - Stack... - read more

A binary search tree of size 9 and depth 3, ... the expected height of the tree approaches square root of the number of keys, ... an optimal binary search tree, ... - 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.