public class BTPreorderTraversal
{
//节点数据结构
static class TreeNode
{
int val;
TreeNode left;
TreeNode right;
TreeNode(int x)
{
val = x;
}
}
public static ArrayList<Integer> preorderTraversal(TreeNode root)
{
if(null == root)
{
return null;
}
ArrayList<Integer> _values = new ArrayList<Integer>();
Deque<TreeNode> _nodes = new ArrayDeque<TreeNode>();
TreeNode _p = root;
//从根节点开始,依次把左节点入栈并取值,若其左节点为空,把该节点出栈(已经被访问过),再访问其右节点,重复该过程
while(null != _p || !_nodes.isEmpty())
{
if(null != _p)
{
_values.add(_p.val);
_nodes.push(_p);
_p = _p.left;
}
else
{
_p = _nodes.peek();
_nodes.pop();
_p = _p.right;
}
}
return _values;
}
}
{
//节点数据结构
static class TreeNode
{
int val;
TreeNode left;
TreeNode right;
TreeNode(int x)
{
val = x;
}
}
public static ArrayList<Integer> preorderTraversal(TreeNode root)
{
if(null == root)
{
return null;
}
ArrayList<Integer> _values = new ArrayList<Integer>();
Deque<TreeNode> _nodes = new ArrayDeque<TreeNode>();
TreeNode _p = root;
//从根节点开始,依次把左节点入栈并取值,若其左节点为空,把该节点出栈(已经被访问过),再访问其右节点,重复该过程
while(null != _p || !_nodes.isEmpty())
{
if(null != _p)
{
_values.add(_p.val);
_nodes.push(_p);
_p = _p.left;
}
else
{
_p = _nodes.peek();
_nodes.pop();
_p = _p.right;
}
}
return _values;
}
}