The height of a binary tree is the maximum depth of all its leaves.
A node's depth is the length of the path back to the root
