Red Black Tree MCQ

Test your knowledge with important Red Black Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Red Black Tree MCQs on Bissoy. Bissoy App

• When to choose Red-Black tree, AVL tree and B-trees?
  ক

  many inserts, many searches and when managing more items respectively

  খ

  many searches, when managing more items respectively and many inserts respectively

  গ

  sorting, sorting and retrieval respectively

  ঘ

  retrieval, sorting and retrieval respectively
• 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
• Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
  ক

  no they are not preferred

  খ

  because of resizing issues of hash table and better ordering in redblack trees

  গ

  because they can be implemented using trees

  ঘ

  because they are balanced
• When it would be optimal to prefer Red-black trees over AVL trees?
  ক

  when there are more insertions or deletions

  খ

  when more search is needed

  গ

  when tree must be balanced

  ঘ

  when log(nodes) time complexity is needed
• Which of the following is an application of Red-black trees and why?
  ক

  used to store strings efficiently

  খ

  used to store integers efficiently

  গ

  can be used in process schedulers, maps, sets

  ঘ

  for efficient sorting
• What are the operations that could be performed in O(logn) time complexity by red-black tree?
  ক

  insertion, deletion, finding predecessor, successor

  খ

  only insertion

  গ

  only finding predecessor, successor

  ঘ

  for sorting
• Cosider the below formations of red-black tree. All the above formations are incorrect for it to be a redblack tree. then what may be the correct order?
  ক

  50-black root, 18-red left subtree, 100-red right subtree

  খ

  50-red root, 18-red left subtree, 100-red right subtree

  গ

  50-black root, 18-black left subtree, 100-red right subtree

  ঘ

  50-black root, 18-red left subtree, 100-black right subtree
• Why do we impose restrictions like . root property is black . every leaf is black . children of red node are black . all leaves have same black
  ক

  to get logarithm time complexity

  খ

  to get linear time complexity

  গ

  to get exponential time complexity

  ঘ

  to get constant time complexity
• What is the special property of red-black trees and what root should always be?
  ক

  a color which is either red or black and root should always be black color only

  খ

  height of the tree

  গ

  pointer to next node

  ঘ

  a color which is either green or black