本文整理汇总了C#中BinarySearchTree.CollectInOrder方法的典型用法代码示例。如果您正苦于以下问题：C# BinarySearchTree.CollectInOrder方法的具体用法？C# BinarySearchTree.CollectInOrder怎么用？C# BinarySearchTree.CollectInOrder使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinarySearchTree的用法示例。
在下文中一共展示了BinarySearchTree.CollectInOrder方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Delete
public void Delete()
{
var tree = new BinarySearchTree<int>();
var firstNode = new TNode<int>(17);
tree.Insert(firstNode);
var secondNode = new TNode<int>(7);
tree.Insert(secondNode);
var thirdNode = new TNode<int>(4);
tree.Insert(thirdNode);
var fourthNode = new TNode<int>(15);
tree.Insert(fourthNode);
tree.Insert(new TNode<int>(10));
tree.Insert(new TNode<int>(16));
tree.Insert(new TNode<int>(8));
tree.Insert(new TNode<int>(12));
tree.Delete(secondNode);
var result = tree.CollectInOrder().ToArray();
var expected = new int[] {4,8,10,12,15,16,17};
for(int i=0; i < expected.Length; i++)
{
Assert.AreEqual(expected[i], result[i], "#E"+i);
}
tree.Delete(thirdNode);
result = tree.CollectInOrder().ToArray();
expected = new int[] {8, 10, 12, 15, 16, 17 };
for (int i = 0; i < expected.Length; i++)
{
Assert.AreEqual(expected[i], result[i], "#EE" + i);
}
tree.Delete(firstNode);
result = tree.CollectInOrder().ToArray();
expected = new int[] { 8, 10, 12, 15, 16};
for (int i = 0; i < expected.Length; i++)
{
Assert.AreEqual(expected[i], result[i], "#EEE" + i);
}
}示例2: InOrder
public void InOrder()
{
var tree = new BinarySearchTree<int>();
tree.Insert(new TNode<int>( 8));
tree.Insert(new TNode<int>( 15 ));
tree.Insert(new TNode<int> ( 5));
tree.Insert(new TNode<int> ( 17 ));
tree.Insert(new TNode<int> ( 14 ));
var content = new int[] {5, 8, 14, 15, 17};
var result = tree.CollectInOrder().ToArray();
Assert.AreEqual(content.Length, result.Length, "#B01");
for (int i = 0; i < result.Length; i++)
{
Assert.AreEqual(content[i], result[i], "#B"+i);
}
}