目录
二叉树的前序遍历
顺序为 中、左、右
/*方法二: 迭代的方式
*/
public List<Integer> preOrder2(TreeNode root) {
List<Integer> result = new ArrayList<>();
Deque<TreeNode> stack = new LinkedList<>();
// Stack<TreeNode> stack = new Stack<>();//也是stack
if (root == null) return result;
stack.push(root);
while (!stack.isEmpty()) {
TreeNode node = stack.pop();
result.add(node.val);
if (node.right != null) stack.push(node.right);
if (node.left != null) stack.push(node.left);
}
return result;
}
/*
方法一: 递归方式
*/
public List<Integer> preOrder1(TreeNode root) {
List<Integer> result = new ArrayList<>();