The Gateway to Computer Science Excellence
+4 votes

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 known as

  1. binary search tree
  2. AVL tree
  3. completely balanced tree
  4. Heap
in DS by Veteran (105k points)
edited by | 2.2k views

1 Answer

+7 votes
Best answer
Heap or (max heap) which is a complete binary tree with every node has value more than or equal to  its children
by Boss (48.8k points)
selected by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,554 answers
101,562 users