Which of the following pair’s traversals on a binary tree can build the tree uniquely?

Related MCQs

• 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
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• 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 graph traversals closely imitates level order traversal of a binary tree?
• In a binary search tree, which of the following traversals would print the numbers in the ascending order?
• The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
• A binary tree of depth "d" is an almost complete binary tree if __________.
• Which of the following properties are obeyed by all three tree – traversals?
• To obtain a prefix expression, which of the tree traversals is used?
• The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is