In the attached file, you will find a function that creates a binary search tree of a given size and files that will randomly generate keys in the range [1,1000]. The value associated with each key can be passed to the function, default is 1.Complete the program by implementing the necessary code to perform the following tasks:Create a binary search tree of size 20, name it bstPrint all keys in bst on a single line to save spacePrint the mimimum key in bstPrint the smallest key larger than 500 in bst (if any)Print all keys in the range [100,300] in bstPrint the tree heightImport the modules first before doing this.from bst.binary_search_tree import TreeMapfrom AVLTreeMap import AVLTreeMapimport randomdef create(size, value = 1): bst = AVLTreeMap() # or just use AVLTreeMap() counter = 0 while counter<size: val = random.randint(1,1000) if not val in bst.keys(): bst[val] = value counter +=1 return bst

It is defined as an efficient algorithm for finding an item from a sorted list of items. It works by…

Answered: attached file, you will find a function…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

In the attached file, you will find a function that creates a binary search tree of a given size and files that will randomly generate keys in the range [1,1000]. The value associated with each key can be passed to the function, default is 1.

Complete the program by implementing the necessary code to perform the following tasks:

Create a binary search tree of size 20, name it bst
Print all keys in bst on a single line to save space
Print the mimimum key in bst
Print the smallest key larger than 500 in bst (if any)
Print all keys in the range [100,300] in bst
Print the tree height

Import the modules first before doing this.

from bst.binary_search_tree import TreeMap
from AVLTreeMap import AVLTreeMap
import random

def create(size, value = 1):
    bst = AVLTreeMap()     # or just use AVLTreeMap()
    counter = 0
    while counter<size:
        val = random.randint(1,1000)
        if not val in bst.keys():
            bst[val] = value
            counter +=1
    return bst

Expert Solution