What is the time complexity of pre-order traversal in the iterative f – McqOptions

MCQOPTIONS

1.	What is the time complexity of pre-order traversal in the iterative fashion?
A.	O(1)
B.	O(n)
C.	O(logn)
D.	O(nlogn)
Answer» C. O(logn)

Discussion

No Comment Found

Related MCQs

Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences.S1: N, M, P, O, QS2: N, P, Q, O, MS3: M, N, O, P, Q
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
To obtain a prefix expression, which of the tree traversals is used?
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)
What is the time complexity of pre-order traversal in the iterative fashion?
For the tree below, write the post-order traversal.
For the tree below, write the pre-order traversal.