C# (CSharp) BalancedTree.PrintSorted Examples

Example #1

File: Program.cs Project: AndreReise/algorithms-and-structures

        static void Main(string[] args)
        {
            BalancedTree <int> tree = new BalancedTree <int>();

            List <int> insertList = new List <int> {
                9, 5, 10, 0, 6, 11, -1, 1, 2
            };

            foreach (var item in insertList)
            {
                tree.Root = tree.Insert(tree.Root, item);
            }

            tree.PrintSorted();

            tree.Root = tree.DeleteNode(tree.Root, -1);

            tree.PrintSorted();
        }