本文整理匯總了C#中BinaryTree.Equals方法的典型用法代碼示例。如果您正苦於以下問題：C# BinaryTree.Equals方法的具體用法？C# BinaryTree.Equals怎麽用？C# BinaryTree.Equals使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類BinaryTree的用法示例。
在下文中一共展示了BinaryTree.Equals方法的2個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的C#代碼示例。
示例1: Main
static void Main(string[] args)
{
BinaryTree<int> tree = new BinaryTree<int>();
tree.Insert(2);
tree.Insert(3);
tree.Insert(5);
tree.Insert(8);
tree.Insert(11);
tree.Insert(200);
tree.Insert(120);
tree.Insert(600);
Console.WriteLine(tree);
Console.WriteLine(tree.Count);
tree.Remove(2);
tree.Remove(5);
tree.Remove(8);
Console.WriteLine(tree);
tree.Remove(11);
tree.Remove(200);
tree.Remove(120);
tree.Remove(600);
tree.Remove(3);
Console.WriteLine(tree);
Console.WriteLine(tree.Count);
tree.Insert(10);
tree.Insert(20);
tree.Insert(30);
tree.Insert(60);
tree.Insert(1);
tree.Insert(500);
tree.Insert(2);
Console.WriteLine(tree);
Console.WriteLine(tree.Count);
var newTree = new BinaryTree<int>();
newTree.Insert(10);
newTree.Insert(20);
newTree.Insert(30);
newTree.Insert(60);
newTree.Insert(1);
newTree.Insert(500);
newTree.Insert(2);
Console.WriteLine(newTree);
Console.WriteLine(newTree.Count);
Console.WriteLine(tree.Equals(newTree));
foreach (var value in tree)
{
Console.WriteLine(value);
}
BinaryTree<int> r = null;
Console.WriteLine(tree.Equals(r));
int a = 5;
Console.WriteLine(a.Equals(null));
}示例2: 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());
}