import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
/**
* Create by yangshunfan
* 2018/4/2 22:17
* 二叉树的前序遍历
*/
public class Test66 {
public List<Integer> preorderTraversal(TreeNode root) {
// write your code here
Stack<TreeNode> stack = new Stack<TreeNode>();
List<Integer> list = new ArrayList<Integer>();
if (root == null) {
return list;
}
stack.push(root);
while (!stack.empty()) {
TreeNode node = stack.pop();
list.add(node.val);
if (node.right != null) {
stack.push(node.right);
}
if (node.left != null) {
stack.push(node.left);
}
}
return list;
}
}
LintCode66二叉树的前序遍历
最新推荐文章于 2019-03-10 01:13:39 发布