i want the code by c# language

22:44 AN 650 2_52267469646698... 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 (Dm Ekleme) Add Node (5 Points): Add a node to the binary search tree. (Duum Silme) Node Delete (10 Points): Delete a node from the binary search tree. (Aa Bilgilerini Gster) Show Tree Information (5 Points): Traversal algorithms on a binary search tree, node obtaining the number, height and leaf information (Silinin Dgmleri Gster) 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. (Silinen Dmlerin Aaca Tekrar Eklenmesi) Re-Adding Deleted Nodes to Tree (25 points): Deleted and kept in queue structure nodes will be re-added to the tree, (Aa Dmlerin Grafiksel Gsterimi)Graphical Representation of Tree Nodes (50 Points): Nodes in the Binary Search tree are in Figure 1. 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. 22:44 AN 650 2_52267469646698... 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 (Dm Ekleme) Add Node (5 Points): Add a node to the binary search tree. (Duum Silme) Node Delete (10 Points): Delete a node from the binary search tree. (Aa Bilgilerini Gster) Show Tree Information (5 Points): Traversal algorithms on a binary search tree, node obtaining the number, height and leaf information (Silinin Dgmleri Gster) 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. (Silinen Dmlerin Aaca Tekrar Eklenmesi) Re-Adding Deleted Nodes to Tree (25 points): Deleted and kept in queue structure nodes will be re-added to the tree, (Aa Dmlerin Grafiksel Gsterimi)Graphical Representation of Tree Nodes (50 Points): Nodes in the Binary Search tree are in Figure 1. 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