Use Java.

Given the text file, follow the instructions and put the integers into a binary tree. Read in the file using BufferedReader. Below are the input.txt and expected solution.

input.txt:

insert 40,50,30,20,60,35,45,47

find 35

delete 50

traverse 1

traverse 2

traverse 3

min

max

show

expected outcome:

Inserting: 40,50,30,20,60,35,45,47

Found: {35, 35.9}

Deleted: 50

Preorder traversal: 40 30 20 35 60 45 47

Inorder traversal: 20 30 35 40 45 47 60

Postorder traversal: 20 35 30 47 45 60 40

Min: {20, 20.9}

Max: {60, 60.9}

.................................................................

40

.................................................................

30 60

.................................................................

20 35 45 --

.................................................................

-- -- -- -- -- 47 -- --