Q181
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.right = redblackt(root.right, pt) root.right.parent = root return root
A.
insert a new node
AnswerB.
delete a node
C.
search a node
D.
count the number of nodes
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board