C# (CSharp) BinaryTreeImplementation示例

示例#1

        public void Tree_StartsEmpty()
        {
            var tree = new BinaryTreeImplementation();

            Assert.Equal(-1, tree.Height());
            Assert.Equal(0, tree.CountNodes());
        }

示例#2

        public void Tree_ReturnsFalseIfTreeDoesNotContainElement()
        {
            var tree = new BinaryTreeImplementation();

            tree.Insert(30);
            tree.Insert(20);
            tree.Insert(40);
            Assert.False(tree.Contains(120));
        }

示例#3

        public void Tree_ReturnsTrueIfTreeContainsElement()
        {
            var tree = new BinaryTreeImplementation();

            tree.Insert(30);
            tree.Insert(20);
            tree.Insert(40);
            Assert.True(tree.Contains(20));
        }

示例#4

        public void Tree_CanGetMinimumValue()
        {
            var tree = new BinaryTreeImplementation();

            tree.Insert(30);
            tree.Insert(20);
            tree.Insert(40);
            Assert.Equal(20, tree.MinValue());
        }

示例#5

        public void Tree_CanCountNodes()
        {
            var tree = new BinaryTreeImplementation();

            tree.Insert(30);
            tree.Insert(20);
            tree.Insert(40);
            Assert.Equal(3, tree.CountNodes());
            Assert.Equal(3, tree.CountNodesWithQueue());
        }

示例#6

        public void Tree_CanInsertNodes()
        {
            var tree = new BinaryTreeImplementation();

            tree.Insert(30);
            tree.Insert(20);
            tree.Insert(40);

            Assert.Equal(1, tree.Height());
            Assert.Equal(1, tree.GetMaximumDepth());
        }