首页 > 代码库 > 【LeetCode】Binary Tree Preorder Traversal
【LeetCode】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?
解答/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ //1.递归 public class Solution { public ArrayList<Integer> preorderTraversal(TreeNode root) { ArrayList<Integer> result=new ArrayList<Integer>(); preorder(root,result); return result; } public void preorder(TreeNode root,ArrayList<Integer> result){ if(root!=null){ result.add(root.val); preorder(root.left,result); preorder(root.right,result); } } } //2.非递归 public class Solution { public ArrayList<Integer> preorderTraversal(TreeNode root) { ArrayList<Integer> result=new ArrayList<Integer>(); if(root==null) return result; Stack<TreeNode> stack=new Stack<TreeNode>(); stack.push(root); while(!stack.empty()){ TreeNode tn=stack.pop(); result.add(tn.val); if(tn.right!=null){ stack.push(tn.right); } if(tn.left!=null){ stack.push(tn.left); } } return result; } }
---EOF---
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。