試題詳解

69. Height of a tree is defined as the length of the path from its root to its farthest leaf node. Now given a binary tree with n nodes, which one of the following is the longest height of the tree？
(A) log n
(B) n log n
(C) n – 1
(D) n2