Just curious if I should devote some time in studying it.
A must
Traditionally you need to reinsert every child node of the node back into the tree, but using an AVL tree reduces the overhead by optimizing using shifting.
Also, do you need to study do-while loops or are while and for loops enough?
God no. Just memorize quick answers to Glassdoor questions – 99.9% of interviewers ask the same questions for years and years. More importantly, invest some time in LP question practice.
Troll
Not at all. Our technical bar is notoriously low.
Right click and move to trash Simple! So you want to know how to recover a BST?
Yes
What about AVL trees, red-black trees or any other trees?
B+ tree, Trie, N-ary tree. Avl trees are rare in amazon interviews.