4 votes 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 binary search tree AVL tree completely balanced tree Heap DS isro2008 data-structures binary-tree + – go_editor asked Jun 13, 2016 edited Jun 28, 2016 by Desert_Warrior go_editor 3.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 8 votes 8 votes Heap or (max heap) which is a complete binary tree with every node has value more than or equal to its children Sanjay Sharma answered Jun 13, 2016 selected Jun 26, 2016 by Arjun Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.