当前位置：网站首页>LeetCode 94.二叉树的中序遍历（简单）

LeetCode 94.二叉树的中序遍历（简单）

2022-08-10 05:32:00 【生信研究猿】

python 递归

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        self.list1 = []
        self.inorder(root)
        
        return self.list1
    

    def inorder(self,root):
        p = root
        if(p==None):
            return 
        self.inorder(p.left)
        self.list1.append(p.val)
        self.inorder(p.right)