forked from psounis/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtree.py
More file actions
86 lines (68 loc) · 2.08 KB
/
tree.py
File metadata and controls
86 lines (68 loc) · 2.08 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
class Node:
def __init__(self, data, left=None, right=None):
self.data = data
self.left = left
self.right = right
class Tree:
def __init__(self):
self.root = None
def insert_root(self, data):
n = Node(data)
self.root = n
def insert_left(self, node, data):
n = Node(data)
node.left = n
def insert_right(self, node, data):
n = Node(data)
node.right = n
def __str__(self):
st = ""
def rec_str(n):
nonlocal st
if n is None:
st += "_"
else:
st += str(n.data)
st += "("
rec_str(n.left)
st += ","
rec_str(n.right)
st += ")"
rec_str(self.root)
return st
class BinarySearchTree(Tree):
def __init__(self):
super().__init__()
def insert(self, data):
if self.root is None:
self.insert_root(data)
print(str(data) + " inserted!")
node = self.root
while True:
if data == node.data:
print(str(data) + " already in tree. ")
break
elif data < node.data:
if node.left is None:
node.left = Node(data)
print(str(data) + " inserted!")
break
else:
node = node.left
else: # data > node.data
if node.right is None:
node.right = Node(data)
print(str(data) + " inserted!")
break
else:
node = node.right
def inorder(self):
ret_list = []
def rec_inorder(node):
nonlocal ret_list
if node is not None:
rec_inorder(node.left)
ret_list += [node.data]
rec_inorder(node.right)
rec_inorder(self.root)
return ret_list