Which of the following is true about the height of a binary tree?
-
Height is the number of nodes in the longest path from root to leaf
-
Height is the number of edges in the longest path from root to leaf
-
Height is always equal to the number of levels in the tree
-
Height can be negative
