My Report

Data Structure I Mock Test 5


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

Question 1 of 10

1. The number of edges from the node to the deepest leaf is called _________ of the tree.

Question 1 of 10

Question 2 of 10

2. An AVL tree is a self - balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________

Question 2 of 10

Question 3 of 10

3. What is a complete binary tree?

Question 3 of 10

Question 4 of 10

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

Question 4 of 10

Question 5 of 10

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

Question 5 of 10

Question 6 of 10

6. Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

Question 6 of 10

Question 7 of 10

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

Question 7 of 10

Question 8 of 10

8. Which of the following is not an advantage of trees?

Question 8 of 10

Question 9 of 10

9. What is a weight balanced tree?

Question 9 of 10

Question 10 of 10

10. What should be the condition for the level of a left node?

Question 10 of 10


 

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.