What is red black tree in data structure?
- 1 Answers
- 1001 Views
- I also Faced
- E-Mail Answers
Answer / Naveen Singh Kuldeep
A Red-Black Tree is a self-balancing binary search tree that maintains an additional color (red or black) attribute for each node, providing better performance than regular binary search trees.
| Is This Answer Correct ? | 0 Yes | 0 No |
How would you use bsearch() function to search a name stored in array of pointers to string?
Can we use any class as map key?
difference between the run time polymorphism and compile time poly morphism and about virtual function.
2 Answers CybAge, Innowe, TCS, Wipro,
how to add an item to the beginning of the list?
How do you rotate an AVL tree?
What is list data structure?
Does arraylist extend list?
Who invented data structure?
What is tree and its properties?
In what areas do data structures applied?
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1
What is insertion sort technique?
Windows 
