Depth vs Distance in a Binary Search Tree

1
votes

Is the depth of a node in a Binary Search Tree (BST) the same as it's distance from the root? I think so, but I'm not certain. I believe distance is the concept of trees in general and depth is that concept applied to BSTs.

1
treedistancebinary-search-treedepth

1 Answers

2
votes

Yes, depth = distance from root. From here:

The depth of a node n is the length of the path from the root to the node.