The length of the longest path from the root of a binary tree to a leaf node is the height of the binary tree. It is, also, known as depth of a binary tree.

This is a companion discussion topic for the original entry at http://iq.opengenus.org/find-height-or-depth-of-binary-tree/