本文整理汇总了C#中BinaryTree.Inorder方法的典型用法代码示例。如果您正苦于以下问题：C# BinaryTree.Inorder方法的具体用法？C# BinaryTree.Inorder怎么用？C# BinaryTree.Inorder使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTree的用法示例。
在下文中一共展示了BinaryTree.Inorder方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Point2D_InOrderTraversal_CustomComparerTest
public void Point2D_InOrderTraversal_CustomComparerTest()
{
BinaryTree<Point2D> bt = new BinaryTree<Point2D>();
Point2D[] elemToAdd =
{
new Point2D{X = 1, Y = 2},
new Point2D{X = 10, Y = 2},
new Point2D{X = 2, Y = 1},
new Point2D{X = 4, Y = 4}
};
bt.Comparer = new CustomComparer<Point2D>((p1,p2) => (p1.X + p1.Y) - (p2.X+p2.Y));
foreach (var item in elemToAdd)
bt.Add(item);
List<Point2D> actual = new List<Point2D>();
foreach (var item in bt.Inorder())
{
actual.Add(item);
}
Point2D[] expected =
{
new Point2D{X = 2, Y = 1},
new Point2D{X = 1, Y = 2},
new Point2D{X = 4, Y = 4},
new Point2D{X = 10, Y = 2}
};
CollectionAssert.AreEqual(expected, actual);
}示例2: Integer_InOrderTraversal_DefaultComparerTest
public void Integer_InOrderTraversal_DefaultComparerTest()
{
BinaryTree<int> bt = new BinaryTree<int>();
int[] elemToAdd = { 5, 2, 1, 4, 3, 7, 6, 9, 8 };
foreach (var item in elemToAdd)
bt.Add(item);
List<int> actual = new List<int>();
foreach (var item in bt.Inorder())
{
actual.Add(item);
}
List<int> expected = new List<int>(new int[]{1,2,3,4,5,6,7,8,9});
CollectionAssert.AreEqual(expected,actual);
}示例3: Main
static void Main(string[] args)
{
IReader newReader = new Reader("input.txt");
BinaryTree<Word> tree = new BinaryTree<Word>();
List<string> lines = new List<string>();
lines = newReader.Read();
IParser parser = new Parser();
var words = parser.Parse(lines);
foreach (var w in words.Values)
{
tree.Add(w);
}
Console.WriteLine(string.Join("\n", tree.Inorder()));
Console.ReadKey();
}示例4: Main
static void Main(string[] args)
{
BinaryTree tree = new BinaryTree();
Random rnd = new Random();
for (int i = 0; i < 15; i++)
{
tree.Insert(rnd.Next(100));
}
Console.WriteLine("Inorder Traversal : ");
tree.Inorder(tree.ReturnRoot());
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Preorder Traversal : ");
tree.Preorder(tree.ReturnRoot());
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Postorder Traversal : ");
tree.Postorder(tree.ReturnRoot());
Console.WriteLine(" ");
Console.ReadLine();
}