-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTreeFunctions.cs
62 lines (53 loc) · 1.5 KB
/
BinaryTreeFunctions.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
using System;
namespace dojo
{
public static class BinaryTreeFunctions
{
public static void AddNode(ref BinaryNode rootNode, int value)
{
if (rootNode == null)
{
rootNode = new BinaryNode(value);
return;
}
if (value < rootNode.Value)
{
AddNode(ref rootNode.LeftNode, value);
}
if (value > rootNode.Value)
{
AddNode(ref rootNode.RightNode, value);
}
}
public static void PrintInOrder(ref BinaryNode rootNode)
{
if (rootNode == null)
{
return;
}
PrintInOrder(ref rootNode.LeftNode);
Console.WriteLine(rootNode.Value);
PrintInOrder(ref rootNode.RightNode);
}
public static void PrintPreOrder(ref BinaryNode rootNode)
{
if (rootNode == null)
{
return;
}
Console.WriteLine(rootNode.Value);
PrintPreOrder(ref rootNode.LeftNode);
PrintPreOrder(ref rootNode.RightNode);
}
public static void PrintPostOrder(ref BinaryNode rootNode)
{
if (rootNode == null)
{
return;
}
PrintPostOrder(ref rootNode.LeftNode);
PrintPostOrder(ref rootNode.RightNode);
Console.WriteLine(rootNode.Value);
}
}
}