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


C# BinarySearchTree.FindParent方法代码示例

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


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

示例1: FindParentNoItemsInBstTest

 public void FindParentNoItemsInBstTest([PexAssumeUnderTest]List<int> elements, int notexistelement)
 {
     PexAssume.IsFalse(elements.Contains(notexistelement));
     BinarySearchTree<int> bst = new BinarySearchTree<int>(elements);
     PexAssert.IsNull(bst.FindParent(notexistelement));
 }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs

示例2: FindParentRootNodeTest

 public void FindParentRootNodeTest([PexAssumeUnderTest]int[] elements)
 {
     PexAssume.IsTrue(elements.Length > 0);
     BinarySearchTree<int> bst = new BinarySearchTree<int>(elements);
     PexAssert.IsNull(bst.FindParent(bst.Root.Value));
 }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs

示例3: FindParentRootNodeTest

        public void FindParentRootNodeTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int> {10, 10, 23, 9};

            Assert.IsNull(bst.FindParent(10));
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs

示例4: FindParentLeftSubTreeTest

 public void FindParentLeftSubTreeTest([PexAssumeUnderTest]int[] elements, int position)
 {
     PexAssume.AreDistinctValues<int>(elements);
     PexAssume.IsTrue(position >= 0 && position < elements.Length);
     BinarySearchTree<int> bst = new BinarySearchTree<int>(elements);
     PexAssume.AreNotEqual(bst.Root.Value, elements[position]);
     PexObserve.ValueForViewing<int>("FindParentValue", bst.FindParent(elements[position]).Value);
 }
开发者ID:taoxiease,项目名称:asegrp,代码行数:8,代码来源:BinarySearchTreeTest.cs

示例5: FindParentRightSubTreeTest

        public void FindParentRightSubTreeTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int> {10, 17, 4, 9, 23};

            Assert.AreEqual(17, bst.FindParent(23).Value);
            Assert.AreEqual(10, bst.FindParent(17).Value);
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:7,代码来源:BinarySearchTreeTest.cs

示例6: FindParentRightSubTreeNodeNotPresentTest

        public void FindParentRightSubTreeNodeNotPresentTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int> {9, 23, 17, 10};

            Assert.IsNull(bst.FindParent(32));
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs

示例7: FindParentNoItemsInBstTest

        public void FindParentNoItemsInBstTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int>();

            Assert.IsNull(bst.FindParent(45));
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs

示例8: FindParentLeftSubTreeTest

        public void FindParentLeftSubTreeTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int> {10, 9, 23, 17, 4};

            Assert.AreEqual(10, bst.FindParent(9).Value);
            Assert.AreEqual(9, bst.FindParent(4).Value);
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:7,代码来源:BinarySearchTreeTest.cs

示例9: FindParentLeftSubTreeNodeNotPresentTest

        public void FindParentLeftSubTreeNodeNotPresentTest()
        {
            BinarySearchTree<int> bst = new BinarySearchTree<int> {10, 9, 23, 17};

            Assert.IsNull(bst.FindParent(4));
        }
开发者ID:taoxiease,项目名称:asegrp,代码行数:6,代码来源:BinarySearchTreeTest.cs


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