Data Structure Red Black Tree Online Exam Quiz
Data Structure Red Black Tree GK Quiz. Question and Answers related to Data Structure Red Black Tree. MCQ (Multiple Choice Questions with answers about Data Structure Red Black Tree
What is the special property of red-black trees and what root should always be?
Options
A : a color which is either red or black and root should always be black color only
B : height of the tree
C : pointer to next node
D : a color which is either green or black
What are the operations that could be performed in O(logn) time complexity by red-black tree?
Options
A : insertion, deletion, finding predecessor, successor
B : only insertion
C : only finding predecessor, successor
D : for sorting
When to choose Red-Black tree, AVL tree and B-trees?
Options
A : many inserts, many searches and when managing more items respectively
B : many searches, when managing more items respectively and many inserts respectively
C : sorting, sorting and retrieval respectively
D : retrieval, sorting and retrieval respectively
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
Options
A : no they are not preferred
B : because of resizing issues of hash table and better ordering in redblack trees
C : because they can be implemented using trees
D : because they are balanced
Which of the following is an application of Red-black trees and why?
Options
A : used to store strings efficiently
B : used to store integers efficiently
C : can be used in process schedulers, maps, sets
D : for efficient sorting
How can you save memory when storing color information in Red-Black tree?
Options
A : using least significant bit of one of the pointers in the node for color information
B : using another array with colors of each node
C : storing color information in the node structure
D : using negative and positive numbering
When it would be optimal to prefer Red-black trees over AVL trees?
Options
A : when there are more insertions or deletions
B : when more search is needed
C : when tree must be balanced
D : when log(nodes) time complexity is needed
Data Structure Adjacency List more Online Exam Quiz
Data Structure Queue Linked List
Data Structure Queue Operations
Data Structure Queue Using Stacks
Data Structure Reverse Word Stack