1.

Which of the following binary tree has the characteristics that the value at each node is at least as large as the values at its children?

A. AVL tree
B. heap
C. binary search tree
D. completely balanced tree
Answer» C. binary search tree


Discussion

No Comment Found