Techiio-author
Started by Peter DanielsSep 22, 2021

Open
Avl tree look up vs insertion

0 VIEWES 0 LIKES 0 DISLIKES SHARE
0 LIKES 0 DISLIKES 0 VIEWES SHARE

I was exploring about AVL trees and found this answer where the person says that the look ups in AVL is faster as compared to insertion or deletion.

Though for all those 3 processes the worst time complexity is still Logarithmic.

Is it because of the rotation or balancing involved during insertion ?

0 Replies

You must be Logged in to reply
Techiio-logo

Techiio is on the journey to build an ocean of technical knowledge, scouring the emerging stars in process and proffering them to the corporate world.

Follow us on:

Subscribe to get latest updates

You can unsubscribe anytime from getting updates from us
Developed and maintained by Wikiance
Developed and maintained by Wikiance