data structures - When to choose RB tree, B-Tree or AVL tree? -
Why should I consider using a RB tree, B tree or AVL tree as a programmer? What is the need to consider important points before making the choice of the elections?
Would someone please explain the structure of each tree with a scenario, why are others selected in terms of these important points?
Take it with a pinch of salt:
B-tree when you have thousands Do more than managing the items and you can slow them down from the disk or some storage medium.
The RB tree when you are inspecting many times, are removed and retrieved on the tree.
The AVL tree is insignificant when it involves and removes your recovery. / P>
Comments
Post a Comment