adplus-dvertising
frame-decoration

Question

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

Answer: (a).breadth first search

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Level order traversal of a tree is formed with the help of

Similar Questions

Discover Related MCQs

Q. Why we prefer threaded binary trees?

Q. The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted

ii)

iii) delete the node at

what must be statement ii) and fill up statement iii)

Q. What may be the psuedo code for finding the size of a tree?

Q. What is the time complexity of pre-order traversal in the iterative fashion?

Q. What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Q. To obtain a prefix expression, which of the tree traversals is used?

Q. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Q. What is the time complexity of level order traversal?

Q. Which of the following graph traversals closely imitates level order traversal of a binary tree?

Q. In a binary search tree, which of the following traversals would print the numbers in the ascending order?

Q. The number of edges from the root to the node is called __________ of the tree.

Q. The number of edges from the node to the deepest leaf is called _________ of the tree.

Q. What is a full binary tree?

Q. What is a complete binary tree?

Q. What is the time complexity for finding the height of the binary tree?

Q. Which of the following is not an advantage of trees?

Q. In a full binary tree if number of internal nodes is I, then number of leaves L are?

Q. In a full binary tree if number of internal nodes is I, then number of nodes N are?

Q. In a full binary tree if there are L leaves, then total number of nodes N are?

Q. Which of the following is correct with respect to binary trees?