QWhat is a red-black tree?

Choose the Best Option

Click any option to instantly check if you're correct.

• A A tree in which each node has at most one child ✔ ✖
• B A tree in which each node has exactly two children ✔ ✖
• C A self-balancing binary search tree in which each node is colored either red or black ✔ ✖
• D A self-balancing binary search tree ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions