InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
What is red black tree? define its properties? |
|
Answer» A red–black tree is a kind of self-balancing binary search tree in computer science. Each NODE of the binary tree has an extra bit, and that bit is often interpreted as the color (red or black) of the node. These color BITS are USED to ensure the tree remains APPROXIMATELY balanced during insertions and deletions. |
|