CSc 7003, Programming for Data Science (Summer 2019)

Program 11 - Binary Search Tree

Complete the methods in the following files:

• BST.py
• Driver.py (this file need not be modified)

A sample run of the Driver program is given below:

$ python3 Driver.py 
************************
BST t3
{ 16, 20, 34, 41, 47, 83, 88, 97, 99, 100, 105 }
************************
BST t4
{ 16, 20, 34, 41, 47, 83, 88, 97, 99, 100, 105 }
************************
t1.isBST()=True
t2.isBST()=False
t3.min()=16
t3.max()=105
t3.member(44)=False
t3.member(47)=True

After t3.insert(24)={ 16, 20, 24, 34, 41, 47, 83, 88, 97, 99, 100, 105 }


After t3.insert(101)={ 16, 20, 24, 34, 41, 47, 83, 88, 97, 99, 100, 101, 105 }


After t3.insert(97)={ 16, 20, 24, 34, 41, 47, 83, 88, 97, 99, 100, 101, 105 }


After t3.delete(83)={ 16, 20, 24, 34, 41, 47, 88, 97, 99, 100, 101, 105 }


After t3.delete(105)={ 16, 20, 24, 34, 41, 47, 88, 97, 99, 100, 101 }


After t3.delete(97)={ 16, 20, 24, 34, 41, 47, 88, 99, 100, 101 }


After t3.delete(22)={ 16, 20, 24, 34, 41, 47, 88, 99, 100, 101 }

height of t3=4
height of t4=6
size of t3=10