本文整理汇总了C#中BinarySearchTree.Preorder方法的典型用法代码示例。如果您正苦于以下问题：C# BinarySearchTree.Preorder方法的具体用法？C# BinarySearchTree.Preorder怎么用？C# BinarySearchTree.Preorder使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinarySearchTree的用法示例。
在下文中一共展示了BinarySearchTree.Preorder方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: BinaryTree_Tests
public void BinaryTree_Tests()
{
var tree1 = new BinarySearchTree<int>();
tree1.Add(24);
tree1.Add(12);
tree1.Add(15);
tree1.Add(67);
tree1.Add(32);
tree1.Add(13);
tree1.Add(89);
tree1.Add(9);
var tree2 = new BinarySearchTree<int>();
tree2.Add(24);
tree2.Add(12);
tree2.Add(15);
tree2.Add(67);
tree2.Add(32);
tree2.Add(13);
tree2.Add(89);
tree2.Add(9);
Console.WriteLine("Inorder traversal resulting Tree Sort");
tree1.Inorder(tree1.Root);
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Preorder traversal");
tree1.Preorder(tree1.Root);
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Postorder traversal");
tree1.Postorder(tree1.Root);
Console.WriteLine(" ");
//Assert.IsTrue(tree1.PathSum(tree1.Root(), 45));
//Assert.IsTrue(tree1.PathSum(tree1.Root(), 51));
//Assert.IsFalse(tree1.PathSum(tree1.Root(), 42));
//Assert.AreEqual(8, tree1.Size(tree1.Root()));
//Assert.AreEqual(9, tree1.Minimum(tree1.Root()));
//Assert.AreEqual(89, tree1.Maximum(tree1.Root()));
//Assert.IsTrue(BinaryTree.AreTwoTreesEqual(tree1.Root(), tree2.Root()));
}示例2: BinaryTreeAlgorithms_Test
public void BinaryTreeAlgorithms_Test()
{
var tree1 = new BinarySearchTree<int>();
tree1.Add(24);
tree1.Add(12);
tree1.Add(15);
tree1.Add(67);
tree1.Add(32);
tree1.Add(13);
tree1.Add(89);
tree1.Add(9);
tree1.Remove(13);
tree1.Remove(24);
//Assert.IsTrue(tree1.PathSum(tree1.Root(), 45));
//Assert.IsTrue(tree1.PathSum(tree1.Root(), 51));
//Assert.IsFalse(tree1.PathSum(tree1.Root(), 42));
//Assert.AreEqual(8, tree1.Size(tree1.Root()));
//Assert.AreEqual(9, tree1.Minimum(tree1.Root()));
//Assert.AreEqual(89, tree1.Maximum(tree1.Root()));
//Assert.IsTrue(BinaryTree.AreTwoTreesEqual(tree1.Root(), tree2.Root()));
Console.WriteLine("Inorder traversal ");
tree1.Inorder(tree1.Root);
Console.WriteLine(" ");
TreeAlgorithms<int>.Mirror(tree1.Root);
Console.WriteLine("Inorder traversal of the Mirror tree");
tree1.Inorder(tree1.Root);
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Preorder traversal");
tree1.Preorder(tree1.Root);
Console.WriteLine(" ");
Console.WriteLine();
Console.WriteLine("Postorder traversal");
tree1.Postorder(tree1.Root);
Console.WriteLine(" ");
}开发者ID:SaurabhNijhawan，项目名称:CSharpAlgorithmsAndDataStructures，代码行数:46，代码来源:BinaryTreeAlgorithmsTests.cs