- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- What is the time complexity of pre-order...

Q. |
## 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» B. O(n) |

View all MCQs in:
Data Structures (DS)

- 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 space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- 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
- The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
- Graph traversal is different from a tree traversal, because
- What is the time complexity of level order traversal?
- What is the advantage of recursive approach than an iterative approach?
- The data structure required for Breadth First Traversal on a graph is?
- What is the traversal strategy used in the binary tree?
- How many orders of traversal are applicable to a binary tree (In General)? 3

Login to Continue

It will take less than 2 minutes

Report MCQ