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

def preOrderTraverse(tree,array):
    #PLR
    if tree is not None:
        array.append(tree.value)
        preOrderTraverse(tree.left,array)
        preOrderTraverse(tree.righti,array)
    return array
def postOrderTraverse(tree,array):
    if tree is not None:
        postOrderTraverse(tree.left,array)
        postOrderTraverse(tree.right,array)
        array.append(tree.value)
    return array
