My Report (&Account)

Cartesian 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. Is Treap a randomized tree.

2. What is the probability of selecting a tree uniformly at random?

3. What is the expected number of leaves in a randomized binary search tree?

4. How many randomized binary search trees can be formed by the numbers (1, 3, 2)?

5. Is mathematical randomized tree can be generated using beta distribution.

6. What is the expected depth of a node in a randomized binary search tree?

7. What is the longest length path for a node x in random binary search tree for the insertion process?

8. Which process forms the randomized binary search tree?

9. Which of the following is not a random tree?

10. What is the range of β in finding the length of the longest path in a randomized binary search tree?


 

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.