If the item to be inserted in an AVL tree is already in the tree, the search ends at a ____.
A) leaf node
B) linear subtree
C) linked subtree
D) nonempty subtree

Question

Quizplus · Accepted Answer

When inserting an item in an AVL tree, if the item is already present, the search for the correct insertion point ends at the node containing the item, which is a nonempty subtree. This is because AVL trees do not allow duplicate items, and the search process traverses the tree based on comparisons until it finds the existing item, stopping at its current location in the tree.

If the Item to Be Inserted in an AVL Tree