Vidyalelo
Data Structure · Q122

Binary Search Trees(B Tree)

Programming · Data Structure · question 122

Q122

What must be the missing logic below so as to print mirror of a tree as below as an example? if(rootnode): mirror(rootnode-->left) mirror(rootnode-->right) //missing end

What must be the missing logic below so as to print mirror of a tree as below as an example?
Binary Search Trees(B Tree) mcq question image

if(rootnode):
  mirror(rootnode-->left)
  mirror(rootnode-->right)
 
  //missing
 
end
A.
swapping of left and right nodes is missing
Answer
B.
swapping of left with root nodes is missing
C.
swapping of right with root nodes is missing
D.
nothing is missing

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Binary Search Trees(B Tree) questions