当前位置：网站首页>LeetCode 94. Inorder Traversal of Binary Trees (Simple)

LeetCode 94. Inorder Traversal of Binary Trees (Simple)

2022-08-10 05:54:00 【Shengxin Research Ape】

python recursion

# 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 = rightclass Solution:def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:self.list1 = []self.inorder(root)return self.list1def inorder(self,root):p = rootif(p==None):returnself.inorder(p.left)self.list1.append(p.val)self.inorder(p.right)