Question
Show the result of deleting 3 from the splay tree shown in Exercise 1 for both the bottom-up and top-down versions.
Step 1
- Once the node is found, splay it to the root. - Remove the node with key 3 from the tree. - The resulting splay tree after deleting 3 will be as follows: ``` 5 / \ 2 8 / \ 1 4 ``` Show more…
Show all steps
Your feedback will help us improve your experience
Chris Trentman and 92 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove that the reverse-delete algorithm always produces a minimum spanning tree when given as input a weighted graph with distinct edge weights. [Hint: Use Exercise 33.]
Trees
Minimum Spanning Trees
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD