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
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- A binary tree whose every node has either zero or two children is called
- A type of binary tree in which all levels except possibly the last are full, and the last level has all its...
- In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?
- Which of the following is a self-adjusting binary search tree with the additional property that recently ac...
- In which of the following binary trees is every level, except possibly the last, completely filled?
- If a binary tree contains either two or zero children, then it is called as
- A 2 - 3 tree is a type of
- In which of the following data structures, every level, except possibly the last, is totally filled, and al...