Vidyalelo
Data Structure · Q80

Binary Search Trees(B Tree)

Programming · Data Structure · question 80

Q80

What is wrong with below code for inorder traversal of inorder threaded binary tree: inordertraversal(threadedtreenode root): threadedtreenode q = inorderpredecessor(root) while(q!=root): q=inorderpredecessor(q) print q.data

A.
inordersuccessor instead of inorderpredecessor must be done
Answer
B.
code is correct
C.
it is code for post order
D.
it is code for pre order

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