本文整理汇总了C#中BinaryTree.ToString方法的典型用法代码示例。如果您正苦于以下问题：C# BinaryTree.ToString方法的具体用法？C# BinaryTree.ToString怎么用？C# BinaryTree.ToString使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTree的用法示例。
在下文中一共展示了BinaryTree.ToString方法的9个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: DeleteWhereOnlyRootExists
public void DeleteWhereOnlyRootExists()
{
var root = new Node(7);
var tree = new BinaryTree(root);
tree.Delete(7);
Assert.AreEqual(String.Empty, tree.ToString());
}示例2: DeleteFromLeftOfRootNodeIsRemoved
public void DeleteFromLeftOfRootNodeIsRemoved()
{
var tree = new BinaryTree(null);
tree.Insert(7);
tree.Insert(1);
tree.Insert(0);
tree.Insert(3);
tree.Insert(2);
tree.Insert(5);
tree.Insert(4);
tree.Insert(6);
tree.Insert(9);
tree.Insert(8);
tree.Insert(10);
tree.Delete(1);
Assert.AreEqual("7,2,0,3,5,4,6,9,8,10", tree.ToString());
}示例3: Random
public void Random()
{
BinaryTree<int> Tree = new BinaryTree<int>();
System.Collections.Generic.List<int> Values = new System.Collections.Generic.List<int>();
System.Random Rand = new System.Random();
for (int x = 0; x < 10; ++x)
{
int Value = Rand.Next();
Values.Add(Value);
Tree.Add(Value);
}
for (int x = 0; x < 10; ++x)
{
Assert.Contains(Values[x], Tree);
}
Values.Sort();
Assert.Equal(Values.ToString(x => x.ToString(), " "), Tree.ToString());
}示例4: Random
public void Random()
{
BinaryTree<int> Tree = new BinaryTree<int>();
System.Collections.Generic.List<int> Values = new System.Collections.Generic.List<int>();
System.Random Rand = new System.Random();
for (int x = 0; x < 10; ++x)
{
int Value = Rand.Next();
Values.Add(Value);
Tree.Add(Value);
}
for (int x = 0; x < 10; ++x)
{
Assert.Contains(Values[x], Tree);
}
Values.Sort();
StringBuilder Builder = new StringBuilder();
Values.ForEach((x) => Builder.Append(x.ToString() + " "));
Assert.Equal(Builder.ToString(), Tree.ToString());
}示例5: Main
static void Main(string[] args)
{
BinaryTree<int> firstTree = new BinaryTree<int>();
firstTree.AddNode(13);
firstTree.AddNode(5);
firstTree.AddNode(12);
firstTree.AddNode(14);
firstTree.AddNode(18);
firstTree.AddNode(15);
firstTree.AddNode(19);
firstTree.AddNode(20);
firstTree.AddNode(13);
firstTree.AddNode(22);
firstTree.AddNode(14);
firstTree.AddNode(18);
firstTree.AddNode(15);
firstTree.AddNode(19);
firstTree.AddNode(20);
firstTree.AddNode(13);
firstTree.AddNode(22);
Console.WriteLine("The first tree - ToString()");
Console.WriteLine(firstTree.ToString());
Console.WriteLine();
BinaryTree<int> secondTree = new BinaryTree<int>();
secondTree.AddNode(13);
secondTree.AddNode(5);
secondTree.AddNode(12);
secondTree.AddNode(14);
secondTree.AddNode(18);
secondTree.AddNode(15);
secondTree.AddNode(19);
secondTree.AddNode(20);
secondTree.AddNode(13);
secondTree.AddNode(22);
Console.WriteLine("The second tree - foreach");
foreach (var node in secondTree)
{
Console.Write(node + " ");
}
Console.WriteLine();
Console.WriteLine();
secondTree.DeleteElement(18);
secondTree.DeleteElement(5);
secondTree.DeleteElement(12);
secondTree.DeleteElement(22);
secondTree.DeleteElement(14);
Console.WriteLine("The second tree after deleting elements - ToString()");
Console.WriteLine(secondTree.ToString());
Console.WriteLine();
//Cloning demonstation
BinaryTree<int> thirdTree = secondTree.Clone();
Console.WriteLine("The third tree - ToString()");
Console.WriteLine(thirdTree.ToString());
Console.WriteLine();
if (firstTree != thirdTree)
{
Console.WriteLine("The trees are NOT equal!");
}
Console.WriteLine();
if (secondTree.Equals(thirdTree))
{
Console.WriteLine("The trees are equal!");
}
Console.WriteLine();
//Search method demonstration - returns bool value
Console.WriteLine("Found? {0}", thirdTree.Search(23));
Console.WriteLine("Found? {0}", thirdTree.Search(20));
Console.WriteLine("Found? {0}", firstTree.Search(-2220));
Console.WriteLine("Found? {0}", secondTree.Search(1387));
Console.WriteLine("Found? {0}", firstTree.Search(5));
Console.WriteLine();
//---------------------------------------------------------
//Also we can create the tree using directly the constructor
BinaryTree<string> fourthTree = new BinaryTree<string>("Hi", new BinaryTree<string>("there", new BinaryTree<string>("mate"), new BinaryTree<string>("What's")), new BinaryTree<string>("up"));
Console.WriteLine("Fourth tree - ToString()");
Console.WriteLine(fourthTree.ToString());
}示例6: InsertWithNoRootSetsRoot
public void InsertWithNoRootSetsRoot()
{
var tree = new BinaryTree(null);
tree.Insert(1);
Assert.AreEqual("1", tree.ToString());
}示例7: InsertValueLessThanRootSetsLeft
public void InsertValueLessThanRootSetsLeft()
{
var tree = new BinaryTree(null);
tree.Insert(7);
tree.Insert(1);
Assert.AreEqual("7,1", tree.ToString());
}示例8: InsertValueGreaterThanRootSetsRight
public void InsertValueGreaterThanRootSetsRight()
{
var tree = new BinaryTree(null);
tree.Insert(7);
tree.Insert(9);
Assert.AreEqual("7,9", tree.ToString());
}示例9: InsertFullTreeTest
public void InsertFullTreeTest()
{
var tree = new BinaryTree(null);
tree.Insert(7);
tree.Insert(1);
tree.Insert(0);
tree.Insert(3);
tree.Insert(2);
tree.Insert(5);
tree.Insert(4);
tree.Insert(6);
tree.Insert(9);
tree.Insert(8);
tree.Insert(10);
Assert.AreEqual("7,1,0,3,2,5,4,6,9,8,10", tree.ToString());
}