BST Traversal

class BST:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def inOrderTraverse(tree, array):
    if tree is None:
        return array
    inOrderTraverse(tree.left,array)
    array.append(tree.value)
    inOrderTraverse(tree.right,array)


def preOrderTraverse(tree, array):
    if tree is None:
        return array
    array.append(tree.value)
    preOrderTraverse(tree.left,array)
    preOrderTraverse(tree.right,array)


def postOrderTraverse(tree, array):
    if tree is None:
        return array

    postOrderTraverse(tree.left,array)
    postOrderTraverse(tree.right,array)
    array.append(tree.value)

root = BST(10)
root.left = BST(5)
root.left.left = BST(2)
root.left.left.left = BST(1)
root.left.right = BST(5)
root.right = BST(15)
root.right.right = BST(22)

preArr = []
postArr = []
inArr = []
preOrderTraverse(root, preArr)
postOrderTraverse(root, postArr)
inOrderTraverse(root, inArr)
print(f"inOrderTravese: {inArr}")
print(f"postOrderTravese: {postArr}")
print(f"preOrderTravese: {preArr}")