Binary Search Tree added

Author: bhavinjawade

BST.py

@@ -0,0 +1,78 @@
+
+class Node:
+    def __init__(self, key):
+        self.key = key 
+        self.left = None
+        self.right = None
+ 
+def inorder(root):
+    if root is not None:
+        inorder(root.left)
+        print root.key,
+        inorder(root.right)
+ 
+def insert( node, key):
+ 
+    if node is None:
+        return Node(key)
+ 
+    if key < node.key:
+        node.left = insert(node.left, key)
+    else:
+        node.right = insert(node.right, key)
+ 
+    return node
+ 
+def minValueNode( node):
+    current = node
+ 
+    while(current.left is not None):
+        current = current.left 
+ 
+    return current 
+ 
+def deleteNode(root, key):
+ 
+    if root is None:
+        return root 
+ 
+    if key < root.key:
+        root.left = deleteNode(root.left, key)
+ 
+    elif(key > root.key):
+        root.right = deleteNode(root.right, key)
+ 
+    else:
+        if root.left is None :
+            temp = root.right 
+            root = None
+            return temp 
+             
+        elif root.right is None :
+            temp = root.left 
+            root = None
+            return temp
+ 
+        temp = minValueNode(root.right)
+        root.key = temp.key
+        root.right = deleteNode(root.right , temp.key)
+ 
+ 
+    return root 
+ 
+root = None
+root = insert(root, 58)
+root = insert(root, 32)
+root = insert(root, 8)
+root = insert(root, 59)
+root = insert(root, 98)
+root = insert(root, 6)
+root = insert(root, 4)
+inorder(root)
+root = deleteNode(root, 59)
+inorder(root)
+root = deleteNode(root, 98)
+inorder(root)
+root = deleteNode(root, 4)
+inorder(root)
+