Retrieval is faster operation in AVL Trees - Data Structure

Q.  Which of the following is the faster operation in AVL Trees?
- Published on 25 Aug 15

a. Insertion
b. Deletion
c. Updation
d. Retrieval

ANSWER: Retrieval

Related Content

 

    Discussion

  • Dave May   -Posted on 22 Feb 17
    Updation is not a word. Please learn English!
  • Nirja Shah   -Posted on 21 Nov 15
    88 Retrieval of element is fast in AVL tree. The number of steps required to find an item depends on the distance between the item and the root node. An AVL tree is balanced binary search tree in which the difference between the height of any node’s left and right subtree is at most one. That’s why searching is faster in AVL tree.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲