Data Structures

1: A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

A.	binary search tree
B.	Binary Tree
C.	Completely balanced tree
D.	Heap
	Answer : D Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement