- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- What is the space complexity of the post...

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) |

A. | O(1) |

B. | O(nlogd) |

C. | O(logd) |

D. | O(d) |

Answer» D. O(d) |

View all MCQs in:
Data Structures (DS)

- 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
- Find the postorder traversal of the binary tree shown below.
- What is the time complexity of pre-order traversal in the iterative fashion?
- 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
- The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- In a full binary tree if number of internal nodes is I, then number of nodes N are?

Login to Continue

It will take less than 2 minutes

Report MCQ