How Can You Save Memory When Storing Color Information In #654
How can you save memory when storing color information in Red-Black tree?
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 Binary Trees - Red Black Tree - Quiz No.1.
How can you save memory when storing color information in Red-Black tree?
using least significant bit of one of the pointers in the node for color information
using another array with colors of each node
storing color information in the node structure
using negative and positive numbering
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
