A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............
A. Binary Search Tree
B. AVL Tree
C. Heap
D. Threaded Binary Tree.
Answer:C
A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............
A. Binary Search Tree B. AVL Tree C. Heap D. Threaded Binary Tree.