What are the applications of the red black tree?
Answers
Answered by
0
1. Red-black tree is self balancing means that no path in the tree will ever be twice as long as any other path.
2. operations like insertion, deletion, search on the tree occur in O(log n) time complexity where n is the number of internal nodes in the tree.
3. The height of the tree with n internal nodes is O(log n)
2. operations like insertion, deletion, search on the tree occur in O(log n) time complexity where n is the number of internal nodes in the tree.
3. The height of the tree with n internal nodes is O(log n)
Answered by
0
Explanation:
a set of rules that must be followed when solving a particular problem
Similar questions