本文整理匯總了C#中BinarySearchTree.Predecessor方法的典型用法代碼示例。如果您正苦於以下問題：C# BinarySearchTree.Predecessor方法的具體用法？C# BinarySearchTree.Predecessor怎麽用？C# BinarySearchTree.Predecessor使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類BinarySearchTree的用法示例。
在下文中一共展示了BinarySearchTree.Predecessor方法的2個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的C#代碼示例。
示例1: CanFindPredecessor
public void CanFindPredecessor()
{
var tree = new BinarySearchTree<int, int>();
tree.Insert(new KeyValue<int, int>(1, 2));
tree.Insert(new KeyValue<int, int>(3, 5));
tree.Insert(new KeyValue<int, int>(2, 7));
Assert.AreEqual(2, tree.Predecessor(2));
Assert.AreEqual(7, tree.Predecessor(3));
}示例2: TestGetPredecessor
public void TestGetPredecessor()
{
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 = size - 1; i >= 0; i--)
{
tree.TryGetNode(i, out node);
var prev = tree.Predecessor(node);
if (i > 0)
Assert.AreEqual(node.Value - 1, prev.Value);
else
Assert.IsNull(prev);
}
}