144. Binary Tree Preorder Traversal

最新推荐文章于 2024-05-30 07:40:02 发布

15wylu

最新推荐文章于 2024-05-30 07:40:02 发布

阅读量118

点赞数

分类专栏： Leetcode LeetCode 文章标签： Leetcode preorder

本文链接：https://blog.csdn.net/qq_32767041/article/details/83862045

版权

Leetcode 同时被 2 个专栏收录

53 篇文章 0 订阅

订阅专栏

LeetCode

37 篇文章 1 订阅

订阅专栏

Description

https://leetcode.com/problems/binary-tree-preorder-traversal/

Solving Ideas

前序遍历

Solution

递归

import java.util.*;
class Solution {
    private void preorderCore(TreeNode root, List<Integer> res){
        if(root == null) return;
        res.add(root.val);
        preorderCore(root.left, res);
        preorderCore(root.right, res);
    }
    
    public List<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> res = new ArrayList<>();
        preorderCore(root, res);
        return res;
    }
}

非递归

import java.util.*;
class Solution {    
    public List<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> res = new ArrayList<>();
        if(root == null) return res;
        
        LinkedList<TreeNode> stack = new LinkedList<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.pop();
            res.add(node.val);
            if(node.right != null) stack.push(node.right);
            if(node.left != null) stack.push(node.left);
        }
        return res;
    }
}