I know that red black tree is a special case of binary-search tree. But what is the advantage of red black trees over BSTs. Is there any advantage regarding complexity.
Does coloring the node cause any difference regarding the complexity? please anyone give me an answer.. Thanks in advance
lulusweety
0
Newbie Poster
Recommended Answers
Jump to Posthttp://en.wikipedia.org/wiki/Red_black_tree describes the difference in fairly good detail. The main difference between the two is in the worst case, where a BST can be as bad as O(n) for insertion, search and delete, …
All 4 Replies
darkagn
315
Veteran Poster
Featured Poster
Nick Evan
4,005
Industrious Poster
Team Colleague
Featured Poster
lulusweety
0
Newbie Poster
haider_up32
0
Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.