Esempio n. 1
0
        static void Main(string[] args)
        {
            LevelOrderTraversal t = new LevelOrderTraversal();

            t.BuildTree();
            //SymmetryTreeIterative s = new SymmetryTreeIterative();
            //Console.WriteLine(s.IsSymmetric(t.root));
            //RightSideView r = new RightSideView();
            //var list = r.RightView(t.root);
            //PrintList(list.ToList());
            //var lst = t.BreadFirstTraversal();
            //PrintList(lst);

            //Cousins c = new Cousins();
            //c.BuildTree();
            //Console.WriteLine(c.IsCousins(2, 4));


            //LinkedList link = new LinkedList();
            //var head = link.AddNode(1);
            //var second = link.AddNode(2);
            //var third = link.AddNode(3);
            //var fourth = link.AddNode(4);
            //fourth.next = second;
            //CycledLinkedList c = new CycledLinkedList();
            //Console.WriteLine(c.OptimizedHasCycle(head));

            //LinkedList link = new LinkedList();
            //var head = link.AddNode(1);
            //link.AddNode(2);
            //link.AddNode(2);
            //Console.WriteLine("Original LinkedList");
            //link.PrintAllListNodes();

            //DeleteDuplicates2 d = new DeleteDuplicates2();
            //d.DeleteDuplicates(head);
            //Console.WriteLine("Removed Duplicates");
            //link.PrintAllListNodes();

            //ReorderLinkedList r = new ReorderLinkedList();
            //r.ReorderList(head);
            //link.PrintAllListNodes();

            //ReverseLinkedListRange r = new ReverseLinkedListRange();
            //r.ReverseBetween(head, 2, 4);
            //link.PrintAllListNodes();

            //RemoveDuplicatesLinkedList r = new RemoveDuplicatesLinkedList();
            //r.RemoveDuplicates(head);
            //Console.WriteLine("Removed Duplicates List");
            //link.PrintAllListNodes();

            //BackTracking find all paths of a binary tree
            AllPathsInATree all = new AllPathsInATree();
            var             lst = all.GetAllPaths(t.root);

            PrintList(lst);
        }
Esempio n. 2
0
        // binary tree
        //              1
        //             / \
        //            2   3
        //           / \ / \
        //          4  5 6  7
        public static void AllTraversals(BinaryTreeNode <int> binaryTree)
        {
            // Preorder Traversal should print 1245367
            Console.WriteLine("Pre order traversal in recursive manner!");
            PreOrderTraversal <int> pOT = new PreOrderTraversal <int>();

            pOT.PreOrder(binaryTree);
            Console.WriteLine("\nWriting in Iterative manner!");
            pOT.IterativePreOrder(binaryTree);
            Console.WriteLine("\n");


            // Inorder Traversal should print 4251637
            Console.WriteLine("\nIn order traversal in recursive manner!");
            InOrderTraversal <int> iOT = new InOrderTraversal <int>();

            iOT.InOrder(binaryTree);
            Console.WriteLine("\nWriting in Iterative manner!");
            iOT.IterativeInOrder(binaryTree);
            Console.WriteLine("\n");

            // Post order traversal should print 4526731
            Console.WriteLine("\nPost order traversal in recursive manner!");
            PostOrderTraversal <int> poOT = new PostOrderTraversal <int>();

            poOT.PostOrder(binaryTree);
            Console.WriteLine("\nWriting in Iterative manner!");
            poOT.IterativePostOrder(binaryTree);
            Console.WriteLine("\n");

            //Level order traversal should be 1234567
            Console.WriteLine("\nLevel order traversal!");
            LevelOrderTraversal <int> lOT = new LevelOrderTraversal <int>();

            lOT.LevelOrder(binaryTree);
        }