Vidyalelo
Data Structure · Q253

Binary Search Trees(B Tree)

Programming · Data Structure · question 253

Q253

How can you save memory when storing color information in Red-Black tree?

A.
using least significant bit of one of the pointers in the node for color information
Answer
B.
using another array with colors of each node
C.
storing color information in the node structure
D.
using negative and positive numbering

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board