問題詳情

5.(20%)Insert the following sequence of keys in order to an initially empty binary search tree:7,16, 25,45,5, 10, 18,30,50,_ 12, 1.Suppose that each node of the tree contains a key greater than or equal to the left subtree, and smaller than or equal to the right subtree. Answer the following questions:
a.What is the height of the binary search tree?

參考答案

答案:C
難度:簡單0.825336
統計:A(2),B(30),C(430),D(33),E(0)

內容推薦

內容推薦