In which of the following trees balance factor of each node be either of 1, -1or 0?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- 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 are Balanced Binary Search Trees?
- If a binary tree contains either two or zero children, then it is called as
- If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the total number of r...
- In Strictly binary tree, out degree of each node will be....
- In which of the following binary trees is every level, except possibly the last, completely filled?
- In which of the following data structures, every level, except possibly the last, is totally filled, and al...
- A 2 - 3 tree is a type of