leetcode鍒烽-94浜屽弶鏍戠殑涓簭閬嶅巻

Posted 2020-12-19

鏍囩锛?a href='http://www.mamicode.com/so/1/div' title='div'>div   root   nbsp   sel   rsa   pen   end   res   棰樼洰   

棰樼洰

缁欏畾涓€涓簩鍙夋爲锛岃繑鍥炲畠鐨?em>涓簭 閬嶅巻銆?/p>

瀹炵幇

#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        result = []
        def inorder(tree, result):
            if tree != None:
                if tree.left != None:
                    inorder(tree.left, result)
                result.append(tree.val)
                if tree.right != None:
                    inorder(tree.right, result)
        inorder(root, result)
        return result