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; }
* }
*/
public class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> trList = new ArrayList();
Stack<TreeNode> st = new Stack<TreeNode>();
if(root == null)
return trList;
st.push(root);
while (!st.empty())
{
TreeNode tr = st.pop();
trList.add(tr.val);
if(tr.right != null)
st.push(tr.right);
if(tr.left != null)
st.push(tr.left);
}
return trList;
}
}