当前位置: 首页>>代码示例>>C#>>正文


C# BinarySearchTree.GetHeight方法代码示例

本文整理汇总了C#中BinarySearchTree.GetHeight方法的典型用法代码示例。如果您正苦于以下问题:C# BinarySearchTree.GetHeight方法的具体用法?C# BinarySearchTree.GetHeight怎么用?C# BinarySearchTree.GetHeight使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在BinarySearchTree的用法示例。


在下文中一共展示了BinarySearchTree.GetHeight方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: BinarySearchTreeTests_GetHeight

        public void BinarySearchTreeTests_GetHeight()
        {
            IBinarySearchTree<int, string> tree = new BinarySearchTree<int, string>();

            int height = tree.GetHeight();

            Assert.AreEqual(0, height);
        }
开发者ID:ZuTa,项目名称:Algorithms,代码行数:8,代码来源:BinarySearchTreeTests.cs

示例2: BinarySearchTests_GetHeight2

        public void BinarySearchTests_GetHeight2()
        {
            IBinarySearchTree<int, string> tree = new BinarySearchTree<int, string>();
            tree.Insert(10, "John");
            tree.Insert(5, "Clark");
            tree.Insert(13, "Pitty");
            tree.Insert(17, "Lilly");

            int height = tree.GetHeight();

            Assert.AreEqual(2, height);
        }
开发者ID:ZuTa,项目名称:Algorithms,代码行数:12,代码来源:BinarySearchTreeTests.cs

示例3: TestGetHeight

        public void TestGetHeight()
        {
            var tree = new BinarySearchTree<int>();
            var size = 10000;
            var random = new Random();

            //building a search tree from sorted values will give unbalanced tree, size should equal to height
            for (int i = 0; i < size; i++)
            {
                tree.Add(i);
            }

            Assert.AreEqual(tree.GetHeight(), size);
        }
开发者ID:deva666,项目名称:BinarySearchTree,代码行数:14,代码来源:BinaryTreeTests.cs


注:本文中的BinarySearchTree.GetHeight方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。