题目链接:binary-tree-preorder-traversal
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
/**
*
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?
confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1
/ \
2 3
/
4
\
5
The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".
*
*/
public class BinaryTreePreorderTraversal {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
// 67 / 67 test cases passed.
// Status: Accepted
// Runtime: 200 ms
// Submitted: 1 minute ago
//简单的前序遍历
//递归版
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> preorder= new ArrayList<Integer>();
preorderTraversal(root, preorder);
return preorder;
}
public void preorderTraversal(TreeNode root, List<Integer> preIntegersorder) {
if (root != null) {
preIntegersorder.add(root.val);
preorderTraversal(root.left, preIntegersorder);
preorderTraversal(root.right, preIntegersorder);
}
}
// 67 / 67 test cases passed.
// Status: Accepted
// Runtime: 197 ms
// Submitted: 0 minutes ago
//遍历版
public List<Integer> preorderTraversal1(TreeNode root) {
if(root == null) return new ArrayList<Integer>();
List<Integer> preorder= new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
stack.push(root);
while(!stack.isEmpty()) {
TreeNode node = stack.pop();
preorder.add(node.val);
if(node.right != null) stack.push(node.right);
if(node.left != null) stack.push(node.left);
}
return preorder;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
}
}