二叉树的前序遍历
递归:
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
preOrder(root,list);
return list;
}
private void preOrder(TreeNode root,List<Integer> list) {
if(root == null)return;
list.add(root.val);
preOrder(root.left,list);
preOrder(root.right,list);
}
迭代1:
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
if(root == null)return list;
//利用辅助栈stack,将每个节点的左右节点放入以便后续的遍历
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while(!stack.isEmpty()) {
TreeNode node = stack.pop();
list.add(node.val);
//先右后左,栈弹出的顺序是先左后右,满足前序遍历的特性
if(node.right