+1 vote
in Data Structures & Algorithms I by (110k points)
Level order traversal of a tree is formed with the help of

(a) breadth first search

(b) depth first search

(c) dijkstra’s algorithm

(d) prims algorithm

My question is based upon Binary Trees using Linked Lists in portion Binary Trees of Data Structures & Algorithms I

This question was addressed to me in an interview for job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (a) breadth first search

The best explanation: Level order is similar to bfs.

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.