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


    Question

    If elements are inserted into a Binary Search Tree in

    strictly ascending order (e.g., 1, 2, 3, 4, 5), what will be the resulting structure of the tree?
    A A perfectly balanced tree. Correct Answer Incorrect Answer
    B A complete binary tree. Correct Answer Incorrect Answer
    C A skewed tree resembling a linked list. Correct Answer Incorrect Answer
    D A full binary tree. Correct Answer Incorrect Answer
    E An AVL tree. Correct Answer Incorrect Answer

    Solution

    If elements are inserted in strictly ascending (or descending) order, each new element will always be inserted as the right (or left) child of the previous element, creating a degenerate tree that behaves like a linked list.

    Practice Next
    ask-question