LeetCode 144. Binary Tree Preorder Traversal

最新推荐文章于 2022-03-07 13:52:02 发布

_天道酬勤_不忘初心

最新推荐文章于 2022-03-07 13:52:02 发布

阅读量516

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_25605637/article/details/79371962

版权

LeetCode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

题目地址：https://leetcode.com/problems/binary-tree-preorder-traversal/description/

思路：二叉树的先序遍历

AC代码（非递归实现）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> vals = new ArrayList<>();
    public List<Integer> preorderTraversal(TreeNode root) {
        Stack<TreeNode> nodes = new Stack<>();
        List<Integer> vals = new ArrayList<>();
        if (root != null)
            nodes.push(root);
        while (!nodes.isEmpty()) {
            //获取头部元素，并且移除
            TreeNode treeNode = nodes.pop();
            vals.add(treeNode.val);
            if (treeNode.right != null) {
                nodes.push(treeNode.right);
            }
            if (treeNode.left != null){
                nodes.push(treeNode.left);
            }
        }
        return vals;
    }
}

AC代码递归实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> vals = new ArrayList<>();
    public List<Integer> preorderTraversal(TreeNode root) {
        if (root != null) {
            vals.add(root.val);
            if (root.left != null) {
                this.preorderTraversal(root.left);
            } 
            if (root.right != null) {
                this.preorderTraversal(root.right);
            }
        }
        return vals;
    }
}