使用前序遍历输出二叉树的节点值 144. 二叉树的前序遍历 没啥可说的,直接看代码吧 递归法 # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def preorderTraversal(self, root: TreeNode