MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
What is the time complexity of level order traver..
1.
What is the time complexity of level order traversal?
A.
O(1)
B.
O(n)
C.
O(logn)
D.
O(nlogn)
Answer» C. O(logn)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In a binary search tree, which of the following traversals would print the numbers in the ascending order?
Which of the following graph traversals closely imitates level order traversal of a binary tree?
What is the time complexity of level order traversal?
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)
For the tree below, write the level-order traversal.
For the tree below, write the in-order traversal.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply