Create a programme that receives an integer N from the command line, produces a random BST of size N, then enters a loop that deletes a random key (using the code delete(select(StdRandom.uniform(N))) and then inserts a random key, looping N times. Calculate and show the average length of a path in the tree after the loop (the internal path length divided by N, plus 1). Run your programme for N = 102, 103, and 104 to verify the rather paradoxical claim that this strategy increases the average route length of the tree in proportion to the square root of N. Experiment with a remove() implementation that randomly selects whether to use the previous or successor node.
Create a programme that receives an integer N from the command line, produces a random BST of size N, then enters a loop that deletes a random key (using the code delete(select(StdRandom.uniform(N))) and then inserts a random key, looping N times. Calculate and show the average length of a path in the tree after the loop (the internal path length divided by N, plus 1). Run your programme for N = 102, 103, and 104 to verify the rather paradoxical claim that this strategy increases the average route length of the tree in proportion to the square root of N. Experiment with a remove() implementation that randomly selects whether to use the previous or successor node.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Create a programme that receives an integer N from the command line, produces a random BST of size N, then enters a loop that deletes a random key (using the code delete(select(StdRandom.uniform(N))) and then inserts a random key, looping N times. Calculate and show the average length of a path in the tree after the loop (the internal path length divided by N, plus 1). Run your programme for N = 102, 103, and 104 to verify the rather paradoxical claim that this strategy increases the average route length of the tree in proportion to the square root of N.
Experiment with a remove() implementation that randomly selects whether to use the previous or successor node.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education