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


C# BinarySearchTree.LCA方法代码示例

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


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

示例1: BinarySearchTreeTests_LCA

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

            IBinarySearchTreeNode<int, string> john = tree.Insert(10, "John");
            IBinarySearchTreeNode<int, string> clark = tree.Insert(5, "Clark");
            IBinarySearchTreeNode<int, string> pitty = tree.Insert(13, "Pitty");

            IBinarySearchTreeNode<int, string> ancestor = tree.LCA(john, pitty);

            Assert.IsNotNull(ancestor);
            Assert.AreEqual(john, ancestor);
        }
开发者ID:ZuTa,项目名称:Algorithms,代码行数:13,代码来源:BinarySearchTreeTests.cs

示例2: BinarySearchTreeTests_LCA5

        public void BinarySearchTreeTests_LCA5()
        {
            IBinarySearchTree<int, string> tree = new BinarySearchTree<int, string>();
            IBinarySearchTreeNode<int, string> lui = tree.Insert(3, "Lui");
            IBinarySearchTreeNode<int, string> clark = tree.Insert(5, "Clark");
            IBinarySearchTreeNode<int, string> joney = tree.Insert(1, "Joney");
            IBinarySearchTreeNode<int, string> jack = tree.Insert(8, "Jack");
            IBinarySearchTreeNode<int, string> john = tree.Insert(10, "John");
            IBinarySearchTreeNode<int, string> ben = tree.Insert(6, "Ben");
            IBinarySearchTreeNode<int, string> lulu = tree.Insert(7, "Lu-lu");
            IBinarySearchTreeNode<int, string> cris = tree.Insert(2, "Cris");
            IBinarySearchTreeNode<int, string> lenon = tree.Insert(0, "Lenon");

            IBinarySearchTreeNode<int, string> ancestor = tree.LCA(lulu, john);

            Assert.IsNotNull(ancestor);
            Assert.AreEqual(jack, ancestor);
        }
开发者ID:ZuTa,项目名称:Algorithms,代码行数:18,代码来源:BinarySearchTreeTests.cs


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