Interview Questions

265. Difference between AVL trees and Red black trees

Microsoft Interview Questions and Answers


(Continued from previous question...)

265. Difference between AVL trees and Red black trees

Question:

Difference between AVL trees and Red black trees


maybe an answer:


1. Difference between levels in AVL tree can be maximum 1 node, while in Red-black tree it can be 2 times more...>
>
2. Insertions and deletions in red-black tree in avarage works faster, because the property of RB tree doesn't require to rebalance it every time

(Continued on next question...)

Other Interview Questions