Resolving deletion in AVL trees
The article discusses the process of resolving deletion in AVL trees, a type of self-balancing binary search tree. It outlines the steps involved in maintaining the tree's balance after deletion, including the use of rotations. The author shares their personal experience and challenges faced while implementing these concepts in C programming.
- ▪AVL trees require calculating the node's height and checking the balance factor after deletion.
- ▪There are four types of rotations used to maintain balance: LL, LR, RL, and RR.
- ▪The author faced issues with segmentation faults and stack overflow during their implementation.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 1852114) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } RIK Posted on May 16 Resolving deletion in AVL trees #dsa #beginners #computerscience #algorithms Started solving for AVL (Adelson-Velsky and Landis, named after its inventors) trees, 3 week back but now i am finally done. For starters like me, got to understand on how efficiently does stack data structure work. Even while dealing with search operations, had to use stack just to keep track on which set of nodes I traversed on. Of course the node traversal starts from the root node.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
