Inorder Successor in BST

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:

    def inorder(self,node,found,p,arr):

        if node == None:
            return None


        if node.left != None:
            found = self.inorder(node.left,found,p,arr)


        if found == False:
            arr.append(node.val)

        if node.val == p:
            found = True



        if node.right  != None:
            found = self.inorder(node.right,found,p,arr)

        return found

    def inorderSuccessor(self, root: 'TreeNode', p: 'TreeNode') -> 'TreeNode':
        arr =[]
        t = self.inorder(root,False,p,arr)
        print(arr[-1])
        print(t)