gs gs121 Binary Trees - Red Black Tree - Quiz No.1
gs gs121 Data Structures and Algorithms Quiz
This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Binary Trees. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: 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
Question 2: 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
. 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
Question 3: Cosider the below formations of red-black tree.
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
Question 4: 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
Question 5: 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
Question 6: 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
Question 7: 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
Question 8: 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
Question 9: 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
Question 10: What is the below pseudo code trying to do, where pt is a node pointer and root pointer?
redblack(Node root, Node pt) : if (root == NULL) return pt if (pt.data < root.data) { root.left = redblack(root.left, pt); root.left.parent = root } else if (pt.data > root.data) { root.right = redblackt(root.right, pt) root.right.parent = root } return root
insert a new node
delete a node
search a node
count the number of nodes
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
