adplus-dvertising
frame-decoration

Question

What is the time complexity of level order traversal?

a.

O(1)

b.

O(n)

c.

O(logn)

d.

O(nlogn)

Answer: (b).O(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

Q. Which of the following is false about a binary search tree?

Q. What is the speciality about the inorder traversal of a binary search tree?

Q. What are the worst case and average case complexities of a binary search tree?

Q. What are the conditions for an optimal binary search tree and what is its advantage?

Q. What is an AVL tree?

Q. Why we need to a binary tree which is height balanced?

Q. What is the maximum height of an AVL tree with p nodes?

Q. To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?