In which of the following data structures, every level, except possibly the last, is totally filled, and all nodes are as far left as possible?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- In which of the following binary trees is every level, except possibly the last, completely filled?
- 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 forms of binary tree is the one in which every non-leaf node has non-empty left and ...
- Which of the following forms of tree has only left subtree?
- How many number of nodes are used in a FULL BINARY TREE of depth 5 with no children (from right to left) ?
- Which of the following types of data structure is the one in which each node points to the next node and al...
- A binary tree whose every node has either zero or two children is called