Untitled

Implement Binary Search Tree for the following functions insert, delete(0 child, 1 child, 2 child), find_maximum, find_minimum, find second minimum and display. Perform the following operation

insert(6)

insert(2)

insert(9)

 insert(4)

insert(13)

insert(7)

insert(1)

inorder()

preorder()

postorder()

findmin()

findmax()

delete(1)

delete(9)