Question: what is the difference between height and depth in a binary search tree?
Answer: The depth of a node is the number of edges from the root to the node. The height of a node is the number of edges from the node to the deepest leaf.