前序遍历
力扣144. 二叉树的前序遍历
1、递归写法
class Solution {
List<Integer> ret = new LinkedList<> ();
public List<Integer> preorderTraversal(TreeNode root) {
if(root == null) {
return ret;
}
ret.add(root.val);
preorderTraversal(root.left);
preorderTraversal(root.right);
return ret;
}
}
运行截图:
2、迭代写法
class Solution {
List<Integer> ret = new LinkedList<> ();
public List<Integer> preorderTraversal(TreeNode root) {
if(root == null) {
return ret;
}
Stack<TreeNode> stack = new Stack<> ();
stack.push(root);
while(!stack.isEmpty()) {
TreeNode node = stack.pop();
ret.add(node.val);
if(node.right != null) {
stack.push(node.right);
}
if(node.left != null) {
stack