本文整理匯總了C#中BinaryTree.Preorder方法的典型用法代碼示例。如果您正苦於以下問題：C# BinaryTree.Preorder方法的具體用法？C# BinaryTree.Preorder怎麽用？C# BinaryTree.Preorder使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類BinaryTree的用法示例。
在下文中一共展示了BinaryTree.Preorder方法的3個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的C#代碼示例。
示例1: TreeWithPointProvider
public void TreeWithPointProvider(CustomPoint[] point, CustomPoint[] resultPoint, IComparer<CustomPoint> comparer)
{
var tree = new BinaryTree<CustomPoint>(point, comparer);
var pointCompare = new PointComparer();
var enumeratorBook = tree.Preorder().ToArray();
CollectionAssert.AreEqual(enumeratorBook, resultPoint, pointCompare);
}示例2: 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();
}示例3: String_PreOrderTraversal_CustomComparerTest
public void String_PreOrderTraversal_CustomComparerTest()
{
BinaryTree<string> bt = new BinaryTree<string>();
CustomComparer<string> comparer = new CustomComparer<string>((str1,str2) => str1.CompareTo(str2)*(-1));
bt.Comparer = comparer;
string[] elemToAdd = { "f", "b", "a", "d", "c", "e", "i", "h", "g", "k", "j" };
foreach (var item in elemToAdd)
bt.Add(item);
List<string> actual = new List<string>();
foreach (var item in bt.Preorder())
{
actual.Add(item);
}
List<string> expected =
new List<string>(new string[] { "f", "i", "k", "j", "h", "g", "b", "d", "e", "c", "a" });
CollectionAssert.AreEqual(expected, actual);
}