LintCode: Binary Tree Preorder Traversal

最新推荐文章于 2025-09-12 16:49:27 发布

weixin_30247159

最新推荐文章于 2025-09-12 16:49:27 发布

阅读量75

点赞数

CC 4.0 BY-SA版权

文章标签：开发工具

原文链接：http://www.cnblogs.com/dingjunnan/p/5271794.html

本文详细介绍了如何使用递归方法来实现二叉树的前序遍历，并通过代码实例展示了实现过程。

Problem:

Given a binary tree, return the preorder traversal of its nodes' values.

Idea:

The trick here is to set a private variable result and refresh it in the helper method, then do the preorder traversal in a recursive way.

Code:

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Preorder in ArrayList which contains node values.
     */
    private ArrayList<Integer> result = new ArrayList<Integer>();
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        // write your code here
        // handle corner case
        if (root == null) {
            return result;
        }
        helper(root);
        return result;
    }
    private void helper(TreeNode node) {
        if (node == null) {
            return;
        }
        // refresh result
        result.add(node.val);
        // go for left and right
        helper(node.left);
        helper(node.right);
    }
}