forked from AllAlgorithms/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmin_height_bst.py
More file actions
84 lines (70 loc) · 2.04 KB
/
min_height_bst.py
File metadata and controls
84 lines (70 loc) · 2.04 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
class Node:
def __init__(self,data):
self.data = data
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def getRoot(self):
return self.root
def add(self,data):
if not self.root:
self.root = Node(data)
else:
self._add(data,self.root)
def _add(self,data,node):
if data <= node.data:
if node.left:
self._add(data,node.left)
else:
node.left = Node(data)
else:
if node.right:
self._add(data,node.right)
else:
node.right = Node(data)
def find(self,data):
if self.root:
self._find(data,self.root)
else:
return None
def _find(data,node):
if data == node.data:
return node
elif node.left and data <= node.data:
return self._find(data,node.left)
elif node.right and data > node.data:
return self._find(data,node.right)
def inorder(self,node):
if node:
self.inorder(node.left)
print node.data
self.inorder(node.right)
def create_min_bst(self,arr,start,end):
if end < start:
return
mid = (start+end) / 2
node = Node(arr[mid])
self.add(node.data)
print 'adding node: ',node.data
node.left = self.create_min_bst(arr,start,mid-1)
node.right = self.create_min_bst(arr,mid+1,end)
def get_height(self,node):
if not node:
return 0
else:
i = max(self.get_height(node.left),self.get_height(node.right)) + 1
return i
def validate_bst(self):
root = self.root
diff = abs(self.get_height(root.left) - self.get_height(root.right))
return diff
def main():
B = BST()
nodes = [1,2,3,4,5,6,7]
B.create_min_bst(nodes,0,len(nodes)-1)
B.inorder(B.root)
print B.validate_bst()
if __name__ == '__main__':
main()