python-wars/dataStructures/binaryTree.py at main · Ry4nW/python-wars · 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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
class BinaryTree():

    def __init__(self, value):

        self.value = value
        self.leftChild = None
        self.rightChild = None

    def insertLeft(self, value):

        if self.leftChild == None:
            self.leftChild = BinaryTree(value)
        else:
            newNode = BinaryTree(value)
            newNode.leftChild = self.leftChild
            self.leftChild = newNode

    def insertRight(self, value):

        if self.rightChild == None:
            self.rightChild = BinaryTree(value)
        else:
            newNode = BinaryTree(value)
            newNode.rightChild = self.rightChild
            self.rightChild = newNode

    def preOrderPrint(self, start, traversal):

        if start:
            traversal += (str(start.value) + '-')
            traversal = self.preOrderPrint(start.leftChild, traversal)
            traversal = self.preOrderPrint(start.rightChild, traversal)

        return traversal

bTRoot = BinaryTree('a')
bTRoot.insertLeft('b')
bTRoot.insertRight('c')

bNode = bTRoot.leftChild
cNode = bTRoot.rightChild

bNode.insertRight('d')
cNode.insertLeft('e')
cNode.insertRight('f')

dNode = bNode.rightChild
eNode = cNode.leftChild
fNode = cNode.rightChild

print(bTRoot.preOrderPrint(bTRoot, ''))