Simple Binary Tree implementation

Author: OmkarPathak

Programs/P62_BinaryTree.py

@@ -0,0 +1,55 @@
+# Author: OMKAR PATHAK
+# A data structure in which a record is linked to two successor records, usually referred to as
+# the left branch when greater and the right when less than the previous record.
+
+class BinaryTree(object):
+
+    def __init__(self,nodeData):
+      self.left = None
+      self.right = None
+      self.nodeData = nodeData
+
+    def getLeftChild(self):
+        return self.left
+
+    def getRightChild(self):
+        return self.right
+
+    def setnodeDataValue(self,value):
+        self.nodeData = value
+
+    def getnodeDataValue(self):
+        return self.nodeData
+
+    def insertRight(self,newnodeData):
+        if self.right == None:
+            self.right = BinaryTree(newnodeData)
+        else:
+            tree = BinaryTree(newnodeData)
+            tree.right = self.right
+            self.right = tree
+
+    def insertLeft(self,newnodeData):
+        if self.left == None:
+            self.left = BinaryTree(newnodeData)
+        else:
+            tree = BinaryTree(newnodeData)
+            self.left = tree
+            tree.left = self.left
+
+
+def printTree(tree):
+        if tree != None:
+            printTree(tree.getLeftChild())
+            print(tree.getnodeDataValue())
+            printTree(tree.getRightChild())
+
+def testTree():
+    myTree = BinaryTree("1")
+    myTree.insertLeft("2")
+    myTree.insertRight("3")
+    myTree.insertRight("4")
+    printTree(myTree)
+
+if __name__ == '__main__':
+    testTree()