[Solved] Which of the following way follows in Post order traversal?

McqMate

Q.	Which of the following way follows in Post order traversal?
A.	Root -> Left sub tree -> Right sub tree.
B.	Root -> Right sub tree -> Left sub tree.
C.	Left sub tree -> Root -> Right sub tree.
D.	Left sub tree -> Right sub tree -> Root.
Answer» D. Left sub tree -> Right sub tree -> Root.

1.8k

0

Do you find this helpful?

21

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
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 pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
Graph traversal is different from a tree traversal, because
For the tree below, write the post-order traversal.
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)
Which of the following graph traversals closely imitates level order traversal of a binary tree?
To perform level-order traversal on a binary tree, which of the following data structure will be required?
For the tree below, write the pre-order traversal.
What is the time complexity of pre-order traversal in the iterative fashion?