Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Which of the following trees are height balanced?
- A. Binary Search Tree
- B. AVL Tree
- C. Red-Black Tree
- D. B-Tree
Choose the correct answer from the options below:
- A and D only
- A, B and D only
- C and D only
- B and C only
Solution
Answer: 4) B and C only
- Binary Search Tree (BST): Not necessarily balanced; height can degrade to O(n).
- AVL Tree: Height-balanced by definition (balance factor −1, 0, +1); height is O(log n).
- Red-Black Tree: Enforces black-height properties that keep height O(log n); treated as a height-balanced binary tree.
- B-Tree: Balanced (all leaves at the same level) but not a binary tree; the term “height-balanced tree” typically refers to binary trees. Hence excluded here.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
