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
inordertraversal(threadedtreenode root):
threadedtreenode q = inorderpredecessor(root)
while(q!=root):
q=inorderpredecessor(q)
print q.dataA. inordersuccessor instead of inorderpredecessor must be done
B. code is correct
C. it is code for post order
D. it is code for pre order
Answer: Option A
This Question Belongs to Data Structure >> Binary Search Trees(B Tree)
Join The Discussion