20240313-二叉树-CSDN博客

本文介绍了如何使用Python实现二叉树的前序遍历，提供了两种方法：递归版本和迭代版本，展示了如何遍历每个节点值并存储在列表中。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

例题1 前序遍历

# 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 preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        ans=[]
        def pre(root):
            if root:
                ans.append(root.val)
                pre(root.left)
                pre(root.right)
            return
        pre(root)
        return ans

class Solution:
    def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        if not root:
            return []
        left=self.preorderTraversal(root.left)
        right=self.preorderTraversal(root.right)
        return [root.val]+left+right
      
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<Integer>();
        if(root == null){
            return res;
        }
        
        res.add(root.val);
        res.addAll(preorderTraversal(root.left));
        res.addAll(preorderTraversal(root.right));
        return res;

    }
}
```