【Leetcode】Binary Tree Preorder Traversal
来源:互联网 发布:centos 安装不上ibus 编辑:程序博客网 时间:2024/06/06 09:13
题目链接:https://leetcode.com/problems/binary-tree-preorder-traversal/
题目:
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 List<Integer> preorderTraversal(TreeNode root) {List<Integer> list = new ArrayList<Integer>();Stack<TreeNode> stack = new Stack<TreeNode>();if (root == null)return list;stack.push(root);while (!stack.isEmpty()) {TreeNode tmp = stack.pop();list.add(tmp.val);if (tmp.right != null) //先压right,先出left,不断的先访问leftstack.push(tmp.right);if (tmp.left != null)stack.push(tmp.left);}return list;}
0 0
- LeetCode Binary Tree Preorder Traversal
- 【LeetCode】Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- Leetcode Binary Tree Preorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- [LeetCode]Binary Tree Preorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- LeetCode | Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- LeetCode - Binary Tree Preorder Traversal
- LeetCode - Binary Tree Preorder Traversal
- 【LeetCode】Binary Tree Preorder Traversal
- [LeetCode]Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal - LeetCode
- [Leetcode] Binary Tree Preorder Traversal
- 信息检索和数据挖掘领域 必备知识总结
- python学习笔记(5)
- 使用js获取表单form的数据
- java—数组(上)
- Visual Studio 2013中引入Web Service的简单方法
- 【Leetcode】Binary Tree Preorder Traversal
- 输入n个数,分别将这些数从大到小排列输出和从小到大排列输出
- NSURL 中的HTTP 中文乱码
- LintCode-剑指Offer-(40)用栈实现队列
- 基于winpcap的网络mac地址发现
- 优雅的浏览 man 手册页
- Android多Activity简介
- 黑马程序员——Java语言的基础语法总结(上)
- 南大软院大神养成计划--day05