A complete binary tree with the property that the value at each — nodeis at least as large as the valuesat its children is known as

A

binary searchtree

B

AVL tree

C

Completely balanced tree

D

Heap