Assignment 3 – Programming 

You are supposed to submit one .zip file through the Blackboard. The .zip file should include all the files under your project folder.

Create a binary search tree (you may choose to use the Graphics class in C# OR just display an inorder traversal of nodes as a console output) from a given array of numbers. For Example, if the given array is 11, 6, 4, 5, 8, 10, 19, 17, 43, 31, 49. You are supposed to program an inorder traversal displaying 4,5,6,8,10,11,17,19,31,43,49, OR display a tree as shown as follows:

Design a program that:

• accepts any a sequence of numbers in an array 

• draws a binary search tree using the insertion method 

o NOTE: insertion method uses a tree search method for locating the position of the new node.

• allows user to insert any new number as a new node in the BST 

• allows user to delete any existing node whose child nodes are internal nodes 

• after each insertion or deletion from the user, displays the inorder traversal of the tree

Student should also include a log (comment), with fewer parts. Each log should indicate each of the following clearly:

• Some comment about how it went - what was hard.