+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following traversing algorithm is not used to traverse in a tree?

(a) Post order

(b) Pre order

(c) Post order

(d) Randomized

Question is taken from Binary Trees using Linked Lists in division Binary Trees of Data Structures & Algorithms I

The question was posed to me in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right answer is (d) Randomized

To explain: Generally, all nodes in a tree are visited by using preorder, inorder and postorder traversing algorithms.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.