Simpilfied bst challenge.

graphs_trees/bst/bst.py

@@ -0,0 +1,18 @@
+class Node(object):
+
+    def __init__(self, data):
+        self.data = data
+        self.left = None
+        self.right = None
+
+def insert(root, data):
+    if data <= root.data:
+        if root.left is None:
+            root.left = Node(data)
+        else:
+            insert(root.left, data)
+    else:
+        if root.right is None:
+            root.right = Node(data)
+        else:
+            insert(root.right, data)