Added tree implementations with lists and OOP

Author: das-jishu

Trees/implement-with-OOP.py

@@ -0,0 +1,37 @@
+
+class BinaryTree(object):
+
+    def __init__(self, value):
+        self.key = value
+        self.leftChild = None
+        self.rightChild = None
+
+    def insertLeft(self, newNode):
+
+        if self.leftChild == None:
+            self.leftChild = BinaryTree(newNode)
+        else:
+            t = BinaryTree(newNode)
+            t.leftChild = self.leftChild
+            self.leftChild = t
+
+    def insertRight(self, newNode):
+
+        if self.rightChild == None:
+            self.rightChild = BinaryTree(newNode)
+        else:
+            t = BinaryTree(newNode)
+            t.rightChild = self.rightChild
+            self.rightChild = t
+
+    def getLeftChild(self):
+        return self.leftChild
+
+    def getRightChild(self):
+        return self.rightChild
+
+    def setRootVal(self, val):
+        self.key = val
+    
+    def getRootVal(self):
+        return self.key

Trees/implement-with-list-of-lists.py

@@ -0,0 +1,35 @@
+
+def BinaryTree(r):
+    return [r, [], []]
+
+def insertLeft(root, newBranch):
+    t = root.pop(1)
+
+    if len(t) > 1:
+        root.insert(1, [newBranch, t, []])
+    else:
+        root.insert(1, [newBranch, [], []])
+    return root
+
+def insertRight(root, newBranch):
+    t = root.pop(2)
+
+    if len(t) > 1:
+        root.insert(2, [newBranch, [], t])
+    else:
+        root.insert(2, [newBranch, [], []])
+    return root
+
+def getRootVal(root):
+    return root[0]
+
+def setRootVal(root, newVal):
+    root[0] = newVal
+
+def getLeftChild(root):
+    return root[1]
+
+def getRightChild(root):
+    return root[2]
+
+