Binary Tree Preorder Traversal python

最新推荐文章于 2020-10-27 12:47:41 发布

ncst

最新推荐文章于 2020-10-27 12:47:41 发布

阅读量523

点赞数

分类专栏：面试算法题

本文链接：https://blog.youkuaiyun.com/sinat_32547403/article/details/79336734

版权

面试算法题专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种实现二叉树前序遍历的非递归方法，并提供了Java及Python两种语言的具体实现代码。该方法使用栈来辅助遍历过程，首先将根节点压入栈中，然后进入循环直至栈为空。每次从栈中弹出节点时记录其值，若该节点有右子树则先将其压入栈中，接着如果有左子树也进行压栈，确保了按前序遍历的顺序访问所有节点。

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

二叉树的前序遍历（非递归）（小米云计算一面）

java

/**
 * 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: A Tree
     * @return: Preorder in ArrayList which contains node values.
     */
    public List<Integer> preorderTraversal(TreeNode root) {
        // write your code here
        Stack<TreeNode> stack = new Stack<>();
        List<Integer> res = new ArrayList<>();
        if (root == null) {
            return res;
        }
        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;
    }
}

python

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""


class Solution:
    """
    @param: root: A Tree
    @return: Preorder in ArrayList which contains node values.
    """
    def preorderTraversal(self, root):
        # write your code here
        if root is None:
            return []
        stack, res = [root], []
        while stack:
            node = stack.pop()
            res.append(node.val)
            if node.right is not None:
                stack.append(node.right)
            if node.left is not None:
                stack.append(node.left)
        return res