Esempi in C# (CSharp) per DFS.DFSBinarySearchTreePostOrderRecursive

Esempio n. 1

        public void DFSBinarySearchTreePostOrderRecursiveTest()
        {
            var binarySearchTree = new BinarySearchTreeKey();

            binarySearchTree.Add("4");
            binarySearchTree.Add("2");
            binarySearchTree.Add("6");
            binarySearchTree.Add("1");
            binarySearchTree.Add("3");
            binarySearchTree.Add("5");
            binarySearchTree.Add("7");

            Assert.Equal(new [] { "1", "3", "2", "5", "7", "6", "4" }, DFS.DFSBinarySearchTreePostOrderRecursive(binarySearchTree.Root));
        }