Question: what is the difference between height and depth of a binary search tree?
Answer: The depth of a node is the number of edges from the node to the tree's root node. ... The height of a node is the number of edges on the longest path from the node to a leaf. A leaf node will have a height of 0.