144. Binary Tree Preorder Traversal Stack version

最新推荐文章于 2024-07-20 22:34:59 发布

zg1g

最新推荐文章于 2024-07-20 22:34:59 发布

阅读量774

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode tree

本文链接：https://blog.csdn.net/daigualu/article/details/71749303

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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

For example:

Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return [1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

代码实现

        public IList<int> PreorderTraversal(TreeNode root)
        {
            IList<int> rtn = new List<int>();
            if (root == null) return rtn;

            Stack<TreeNode> s = new Stack<TreeNode>();
            s.Push(root);
            TreeNode tmp = root;
            while (s.Count > 0)
            {
                if (tmp == null)
                    tmp = s.Peek(); 
                rtn.Add(s.Peek().val);
                s.Pop();
                if(tmp.right!=null)
                   s.Push(tmp.right);
                if (tmp.left != null)
                    s.Push(tmp.left);
                tmp = tmp.left;
            }
            return rtn;
        }