本文整理汇总了C#中BinaryTreeNode.insert方法的典型用法代码示例。如果您正苦于以下问题：C# BinaryTreeNode.insert方法的具体用法？C# BinaryTreeNode.insert怎么用？C# BinaryTreeNode.insert使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTreeNode的用法示例。
在下文中一共展示了BinaryTreeNode.insert方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: testNotInTree
public void testNotInTree()
{
BinaryTreeNode<Int32> root = new BinaryTreeNode<Int32>(2);
root.insert(5);
root.insert(1);
root.insert(16);
bool exceptionCaught_v1 = false;
bool exceptionCaught_v2 = false;
bool exceptionCaught_v3 = false;
#pragma warning disable 168
try {
Assert.AreEqual(eu.sig.training.ch03.binarytree.v1.BinaryTreeSearch.calculateDepth(root, 17), 0);
} catch (TreeException e) {
exceptionCaught_v1 = true;
}
try {
Assert.AreEqual(eu.sig.training.ch03.binarytree.v2.BinaryTreeSearch
.calculateDepth(root, 17), 0);
} catch (TreeException e) {
exceptionCaught_v2 = true;
}
try {
Assert.AreEqual(eu.sig.training.ch03.binarytree.v3.BinaryTreeSearch
.calculateDepth(root, 17), 0);
} catch (TreeException e) {
exceptionCaught_v3 = true;
}
Assert.IsTrue(exceptionCaught_v1);
Assert.IsTrue(exceptionCaught_v2);
Assert.IsTrue(exceptionCaught_v3);
#pragma warning restore 168
}示例2: testSimpleTree
public void testSimpleTree()
{
BinaryTreeNode<Int32> root = new BinaryTreeNode<Int32>(5);
root.insert(3);
root.insert(10);
root.insert(12);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v1.BinaryTreeSearch.calculateDepth(root, 12), 2);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v2.BinaryTreeSearch.calculateDepth(root, 12), 2);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v3.BinaryTreeSearch.calculateDepth(root, 12), 2);
}示例3: testDepth0
public void testDepth0()
{
BinaryTreeNode<Int32> root = new BinaryTreeNode<Int32>(2);
root.insert(5);
root.insert(1);
root.insert(16);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v1.BinaryTreeSearch.calculateDepth(root, 2), 0);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v2.BinaryTreeSearch.calculateDepth(root, 2), 0);
Assert.AreEqual(eu.sig.training.ch03.binarytree.v3.BinaryTreeSearch.calculateDepth(root, 2), 0);
}示例4: Main
static void Main(string[] args)
{
BinaryTreeNode<int> drzewo = new BinaryTreeNode<int>(15);
drzewo.insert(9);
drzewo.insert(20);
drzewo.insert(4);
drzewo.insert(12);
drzewo.insert(17);
drzewo.insert(24);
drzewo.insert(1);
drzewo.insert(5);
foreach (int nazwa in drzewo)
{
Console.WriteLine(nazwa);
}
Console.ReadKey();
}