My Report (&Account)

Binary Search Tree Test


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)

1. A full binary tree can be generated using ______

2. For a binary tree the first node visited in in-order and post-order traversal is same.

3. Find the postorder traversal of the binary tree shown below.
Find the postorder traversal of the binary tree shown

4. The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be ________

5. 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?

6. 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?

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

8. 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.

9. The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is ______

10. In postorder traversal of binary tree right subtree is traversed before visiting root.


 

Start practicing “1000 MCQs on Data Structure”, and once you are ready, you can take tests on all topics by attempting our “Data Structure Test Series”.

advertisement
advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.