What must be the missing logic below so as to print

What must be the missing logic below so as to print...

Home / Data Structure / Binary Search Trees(B Tree) / Question

Examveda

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

A. swapping of left and right nodes is missing

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

Related Questions on Binary Search Trees(B Tree)

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. 1

B. 2

C. 3

D. Any number

View Answer

A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.

B. Check if the tree is balanced.

C. Ensure all nodes have exactly two children.

D. Verify the height of the tree.

View Answer