-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbinary_tree.py
More file actions
142 lines (129 loc) · 4.89 KB
/
binary_tree.py
File metadata and controls
142 lines (129 loc) · 4.89 KB
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#! /usr/local/bin/python
# -*- coding:utf-8 -*-
class BinaryTree:
class Node:
def __init__(self,key,id,parent=None,left=None,right=None):
self.key=key
self.id=id
self.parent=parent
self.left=left
self.right=right
def __init__(self,A=[]):
self.count=1 #var for making Node id unique
self.node=[]
# data[0] is dummy node. It shows tree's start
# and tree's root is Node.right.
self.node.append(self.Node('start',0))
for i in A:
self.insert(i)
def search_node_id(self,k):
node_id=self.node[0].right
#searching node_id
while True:
if node_id==None:
return None
if k==self.node[node_id].key:
return node_id
elif k<self.node[node_id].key:
node_id=self.node[node_id].left
else:
node_id=self.node[node_id].right
def search(self,k):
node_id=self.search_node_id(k)
if node_id==None:
return 'no node'
else:
return self.node[node_id].key
def insert(self,k):
# first insert
if self.node[0].right==None:
self.node.append(self.Node(k,self.count,0))
self.node[0].right=self.count
self.count+=1
else:
#searching insert point
node_id=self.node[0].right
while True:
if k<=self.node[node_id].key:
if self.node[node_id].left==None:
self.node.append(self.Node(k,self.count,node_id))
self.node[node_id].left=self.count
self.count+=1
break
else:
node_id=self.node[node_id].left
else:
if self.node[node_id].right==None:
self.node.append(self.Node(k,self.count,node_id))
self.node[node_id].right=self.count
self.count+=1
break
else:
node_id=self.node[node_id].right
def delete(self,k):
delete_id=self.search_node_id(k)
if delete_id==None:
print 'no node'
return None
else:
delete_node=self.node[delete_id]
# no child
if delete_node.left==None and delete_node.right==None:
if delete_node.key<=self.node[delete_node.parent].key:
self.node[delete_node.parent].left=None
else:
self.node[delete_node.parent].right=None
#one child
elif delete_node.left==None or delete_node.right==None:
if delete_node.key<=self.node[delete_node.parent].key:
if delete_node.left!=None:
self.node[delete_node.parent].left=delete_node.left
else:
self.node[delete_node.parent].left=delete_node.right
else:
if delete_node.left!=None:
self.node[delete_node.parent].right=delete_node.left
else:
self.node[delet_node.parent].right=delete_node.right
#two child
else:
#searching cover node
min_node=self.node[self.node[delete_node.id].right]
while True:
if min_node.left==None:
break
min_node=self.node[self.node[min_node.id].left]
# changing node pointer
if min_node.parent==delete_node.id:
min_node.parent=delete_node.parent
min_node.left=delete_node.left
self.node[delete_node.left].parent=min_node.id
if min_node.key<=self.node[delete_node.parent].key:
self.node[delete_node.parent].left=min_node.id
else:
self.node[delete_node.parent].right=min_node.id
else:
self.node[min_node.parent].left=min_node.right
if min_node.right!=None:
self.node[min_node.right].parent=min_node.parent
min_node.parent=delete_node.parent
min_node.left=delete_node.left
min_node.right=delete_node.right
self.node[delete_node.left].parent=min_node.id
self.node[delete_node.right].parent=min_node.id
if min_node.key<=self.node[delete_node.parent].key:
self.node[delete_node.parent].left=min_node.id
else:
self.node[delete_node.parent].right=min_node.id
if __name__=='__main__':
bt=BinaryTree()
A=[34,51,72,17,66]
print bt.search(34)
for i in A:
bt.insert(i)
bt.insert(43)
print bt.search(17)
print bt.search(30)
print bt.search(72)
bt.delete(51)
print bt.search(43)