In illustrations, binary trees are usually drawn from the root downward, with the root at the top of the drawing and the left and right children respectively given by left and right positions in the d...In illustrations, binary trees are usually drawn from the root downward, with the root at the top of the drawing and the left and right children respectively given by left and right positions in the drawing (Figure \(\PageIndex{1}\)). Because binary trees are so important, a certain terminology has developed for them: The depth of a node, \(\mathtt{u}\), in a binary tree is the length of the path from \(\mathtt{u}\) to the root of the tree.
