what is R-B tree
Answers were Sorted based on User's Feedback
Answer / saurabh gupta
A red black tree is a binary tree where every node has
color.root node is always black , the child of a black node
either.black or red and the child node of every red node
must be black
| Is This Answer Correct ? | 24 Yes | 0 No |
Answer / vinaygupta.1989125
R-B tree is the combination of red black tree there is
always root node is black and child node are red
| Is This Answer Correct ? | 31 Yes | 9 No |
Answer / anupam
A red black tree is a binary tree where
1. every node has color.
2. root node is always black
3. the child of a black node is either black or red
4. both the child nodes of every red node must be black
5. all the leaves must be black
| Is This Answer Correct ? | 7 Yes | 1 No |
Answer / santosh kumar chaudhary
Anupam all your points are right except the last one ,the
last point should be all the leaf node must be red...
| Is This Answer Correct ? | 0 Yes | 0 No |
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Write a Program for Insert in a sorted list
Which sorting algorithm is used in collections sort?
What is the purpose of tochararray ()?
difference between the run time polymorphism and compile time poly morphism and about virtual function.
2 Answers CybAge, Innowe, TCS, Wipro,
What does enum do?
Define the term “percolate up”?
Is hashtable better than dictionary?
Does hashmap maintain insertion order?
What does map stand for?
What is non linear data structure with example?
Explain what is a spanning tree?