阿摩線上測驗
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
答案：登入後查看
統計： A(3), B(2), C(4), D(0), E(0) #3112253
統計： A(3), B(2), C(4), D(0), E(0) #3112253
