algorithmic-complexity-comparison/binaryTree.py at main · ethan-mcmanus-dev/algorithmic-complexity-comparison · GitHub

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
class BinaryTreeNode:
    def __init__(self, root):
        self.key = root
        self.left = None
        self.right = None

    def insertLeft(self, newNode):
        if self.left == None:
            self.left = BinaryTreeNode(newNode)
        else:
            t = BinaryTreeNode(newNode)
            t.left = self.left
            self.left = t

    def insertRight(self, newNode):
        if self.right == None:
            self.right = BinaryTreeNode(newNode)
        else:
            t = BinaryTreeNode(newNode)
            t.right = self.right
            self.right = t

    def right(self):
        return self.right

    def left(self):
        return self.left

    def setVal(self, val):
        self.key = val

    def getVal(self):
        return self.key