题解 | #二叉树的中序遍历#
二叉树的中序遍历
https://www.nowcoder.com/practice/0bf071c135e64ee2a027783b80bf781d
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param root TreeNode类 # @return int整型一维数组 # class Solution: def inorderTraversal(self , root: TreeNode) -> List[int]: # write code here l = [] self.inorder(l,root) return l def inorder(self,list,root): if root == None: return self.inorder(list,root.left) list.append(root.val) self.inorder(list,root.right)