📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    Which of the following is a self-balancing Binary Search

    Tree that ensures a maximum height difference of 1 between the left and right subtrees of any node?
    A Red-Black Tree Correct Answer Incorrect Answer
    B Splay Tree Correct Answer Incorrect Answer
    C B-Tree Correct Answer Incorrect Answer
    D AVL Tree Correct Answer Incorrect Answer
    E Treap Correct Answer Incorrect Answer

    Solution

    An AVL tree is a self-balancing BST where the height difference (balance factor) between the left and right subtrees of any node is at most one. Red-Black trees are also self-balancing but use color properties to maintain balance.

    Practice Next
    More IT Operating System Questions
    ask-question