For a binary tree the first node visited in in-order and post-order tr – McqOptions

MCQOPTIONS

1.	For a binary tree the first node visited in in-order and post-order traversal is same.
A.	True
B.	False
Answer» C.

Discussion

No Comment Found

Related MCQs

For a binary tree the first node visited in in-order and post-order traversal is same.
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?
Which of the following pair s traversals on a binary tree can build the tree uniquely?
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.