-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTreeNode.cs
67 lines (63 loc) · 1.65 KB
/
BinaryTreeNode.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
63
64
65
66
67
using System;
using System.Collections.Generic;
using System.Text;
namespace TryLearnedConcepts
{
public class BinaryTreeNode<T> : Node<T>
{
public BinaryTreeNode() : base() { }
public BinaryTreeNode(T data) : base(data, null) { }
public BinaryTreeNode(T data, BinaryTreeNode<T> left, BinaryTreeNode<T> right)
{
base.Value = data;
NodeList<T> children = new NodeList<T>(2);
children[0] = left;
children[1] = right;
base.Neighbors = children;
}
public BinaryTreeNode<T> Left
{
get
{
if(base.Neighbors == null)
{
return null;
}
else
{
return (BinaryTreeNode<T>)base.Neighbors[0];
}
}
set
{
if (base.Neighbors == null)
{
base.Neighbors = new NodeList<T>(2);
}
base.Neighbors[0] = value;
}
}
public BinaryTreeNode<T> Right
{
get
{
if (base.Neighbors == null)
{
return null;
}
else
{
return (BinaryTreeNode<T>)base.Neighbors[1];
}
}
set
{
if (base.Neighbors == null)
{
base.Neighbors = new NodeList<T>(2);
}
base.Neighbors[1] = value;
}
}
}
}