While reading the part regarding the BSTs, you have learned a lot about the data structure. As such, it is high time to create an example program to see this variant of trees in action. The application will show how to create a BST, add some nodes (both manually and using the previously-presented method for insertion), remove nodes, traverse the tree, and visualize the tree in the console.
Let's adjust the code of the Program class, as shown in the following block of code:
class Program { private const int COLUMN_WIDTH = 5; public static void Main(string[] args) { Console.OutputEncoding = Encoding.UTF8; BinarySearchTree<int> tree = new BinarySearchTree<int>(); tree.Root = new BinaryTreeNode<int>() { Data = 100 ...
