Assignment 3 Programming

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 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

after each insertion from the user, display the inorder traversal of the tree