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.