This is a simple question from algorithms theory. The difference between them is that in one case you count number of nodes and in other number of edges on the shortest
height and depth of a tree is equal...
but height and depth of a node is not equal because...
the height is calculated by traversing from the given node to the deepest possible leaf.
depth is calculated from traversal from root to the given node.....