本文整理汇总了C#中BinarySearchTree.Successor方法的典型用法代码示例。如果您正苦于以下问题：C# BinarySearchTree.Successor方法的具体用法？C# BinarySearchTree.Successor怎么用？C# BinarySearchTree.Successor使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinarySearchTree的用法示例。
在下文中一共展示了BinarySearchTree.Successor方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: CanFindSuccessor
public void CanFindSuccessor()
{
var tree = new BinarySearchTree<int, int>();
tree.Insert(new KeyValue<int, int>(1, 2));
tree.Insert(new KeyValue<int, int>(4, 5));
tree.Insert(new KeyValue<int, int>(2, 7));
Assert.AreEqual(7, tree.Successor(1));
Assert.AreEqual(5, tree.Successor(2));
}示例2: SuccessorTest
public void SuccessorTest()
{
BinarySearchTree target = new BinarySearchTree(); // TODO: Initialize to an appropriate value
BinarySearchTree.Node x = null; // TODO: Initialize to an appropriate value
BinarySearchTree.Node expected = null; // TODO: Initialize to an appropriate value
BinarySearchTree.Node actual;
actual = target.Successor(x);
Assert.AreEqual(expected, actual);
Assert.Inconclusive("Verify the correctness of this test method.");
}示例3: TestGetSuccessor
public void TestGetSuccessor()
{
var tree = new BinarySearchTree<int>();
var size = 10;
Node<int> node = null;
for (int i = 0; i < size; i++)
{
node = tree.Add(i);
}
for (int i = 0; i < size; i++)
{
tree.TryGetNode(i, out node);
var next = tree.Successor(node);
if (i < size - 1)
Assert.AreEqual(node.Value + 1, next.Value);
else
Assert.IsNull(next);
}
}