Uni Project (Data Structures and Alogorithms in C#)
[Function 1: Insert New Product]
[Function 2: Traverse BSTree]
(NOTE: This function also provides the number of nodes and edges in BSTree)
[Function 3: Find Product]
[Function 4: Delete Product]
(NOTE: After deleting 1 product, program will show list of other remaining products in Pre-order Traversal)
[Function 5: Find Depth of BSTree]
How to end program:
If you enter wrong number:
