예제 #1
0
        private static void Test1()
        {
            var root    = new Node <int>(1, new Node <int>(2), new Node <int>(3));
            var inOrder = new InOrderTraversal <int>(root);

            while (inOrder.MoveNext())
            {
                Console.WriteLine(inOrder.Current.Value);
            }
        }
예제 #2
0
        private static void Test3()
        {
            var root  = new Node <int>(1);
            var bTree = new BinaryTree <int>(root);

            root.Left        = new Node <int>(2, new Node <int>(4, new Node <int>(10), new Node <int>(11)), new Node <int>(5, new Node <int>(6), new Node <int>(7)));
            root.Left.Parent = root;

            root.Right        = new Node <int>(3, new Node <int>(8), new Node <int>(9));
            root.Right.Parent = root;

            var traversal = new InOrderTraversal <int>(bTree.Root);

            while (traversal.MoveNext())
            {
                Console.WriteLine(traversal.Current.Value);
            }
        }