-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.cs
106 lines (84 loc) · 2.91 KB
/
Tree.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
using System;
using System.Collections.Generic;
using System.Text;
namespace Proje3
{
class Tree
{
private TreeNode root;
public int sayi;
public Tree() { root = null; }
public TreeNode getRoot() { return root; }
public void preOrder ( TreeNode localRoot)
{
if (localRoot != null)
{
localRoot.displayNode();
preOrder(localRoot.leftChild);
preOrder(localRoot.rightChild);
}
}
public void inOrder (TreeNode localRoot)
{
if (localRoot != null)
{
inOrder(localRoot.leftChild);
localRoot.displayNode();
inOrder(localRoot.rightChild);
}
}
public void postOrder(TreeNode localRoot)
{
if (localRoot != null)
{
postOrder(localRoot.leftChild);
postOrder(localRoot.rightChild);
localRoot.displayNode();
}
}
public void preOrderMüşteriBulmak(TreeNode localRoot, int müşteriID)
{
if (localRoot != null)
{
localRoot.displayNode2(müşteriID);
preOrderMüşteriBulmak(localRoot.leftChild, müşteriID);
preOrderMüşteriBulmak(localRoot.rightChild, müşteriID);
}
}
public void preOrderMüşteriEklemek(TreeNode localRoot, int müşteriID, String durakAdı)
{
if (localRoot != null)
{
localRoot.editNode(müşteriID, durakAdı);
preOrderMüşteriEklemek(localRoot.leftChild, müşteriID, durakAdı);
preOrderMüşteriEklemek(localRoot.rightChild, müşteriID, durakAdı);
}
}
public void insert (Durak newdata, List<Müşteri> müşteriList)
{
TreeNode newNode = new TreeNode();
newNode.data = newdata;
newNode.müşteriler = müşteriList;
if (root == null) { root = newNode; }
else
{
TreeNode current = root;
TreeNode parent;
while (true)
{
parent = current;
if (string.Compare(current.data.durakAdı , newdata.durakAdı) > 0)
{
current = current.leftChild;
if(current==null) { parent.leftChild = newNode; return; }
}
else
{
current = current.rightChild;
if (current==null) { parent.rightChild = newNode; return; }
}
}
}
}
}
}