forked from wuduhren/leetcode-python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinary-search-tree.py
More file actions
executable file
·97 lines (67 loc) · 1.5 KB
/
binary-search-tree.py
File metadata and controls
executable file
·97 lines (67 loc) · 1.5 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
class Node(object):
def __init__(self, val):
self.left = None
self.right = None
self.val = val
class BinarySearchTree(object):
def __init__(self, val):
self.root = Node(val)
def insert(self, val):
def helper(node, val):
if val>node.val:
if node.right:
helper(node.right, val)
else:
node.right = Node(val)
elif val<node.val:
if node.left:
helper(node.left, val)
else:
node.left = Node(val)
helper(self.root, val)
# self.printTree()
def search(self, val):
def helper(node, val):
if node==None:
return False
elif val==node.val:
return True
elif val>node.val:
return helper(node.right, val)
elif val<node.val:
return helper(node.left, val)
print helper(self.root, val)
# self.printTree()
def inOrderPrint(self):
def helper(node):
if node.left: helper(node.left)
print node.val
if node.right: helper(node.right)
helper(self.root)
def preOrderPrint(self):
def helper(node):
print node.val
if node.left: helper(node.left)
if node.right: helper(node.right)
helper(self.root)
def postOrderPrint(self):
def helper(node):
if node.left: helper(node.left)
if node.right: helper(node.right)
print node.val
helper(self.root)
tree = BinarySearchTree(4)
tree.insert(2)
tree.insert(1)
tree.insert(3)
tree.insert(5)
tree.insert(5)
tree.insert(7)
tree.inOrderPrint()
print '====='
tree.preOrderPrint()
print '====='
tree.postOrderPrint()
print '====='
tree.search(3)
tree.search(10)