Add Node Node Delete Show Tree Information tree information preorder Show Nodes of Delete inorder Postorder Re-Adding Deleted Nodes to Tree total number of knots in the tree the height of the tree leaves Graphical Representation of Tree Nodes 25 10 40 20 30 50 PROJECT DESCRIPTION: The interface design of the project required for the make-up exam. It is given in 1. The required operations for the binary search tree in the project are given below. Tree structure will be set up with linked lists. Ready functions will not be accepted 1. Add Node (5 Points): Add a node to the binary search tree. 2.Node Delete (10 Points): Delete a node from the binary search tree. 3.Show Tree Information (5 Points): Traversal algorithms on a binary search tree, node obtaining the number, height and leaf information. 4. Show Nodes of Delete (5 Points): Nodes deleted from the tree will be kept in the queue structure. These nodes will be displayed to the user when requested. Queue structure with linked lists must be created. Ready functions will not be accepted. 5. Re-Adding Deleted Nodes to Tree (25 Points): Deleted and kept in queue structure nodes will be re-added to the tree. 6.Graphical Representation of Tree Nodes (50 Points): Nodes in the Binary Search tree are in Figure. will be drawn on the form as shown. "System.Drawing" in C# for this part of the project You can add the library and use Graphics, SolidBrush, Pen classes