递归遍历
思路
经典递归三部曲
确定递归函数的参数和返回值
确定终止条件
确定单层递归的逻辑
代码实现
//不同顺序的区别只是res.add 这一步的区别
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
traversalFun(root, res);
return res;
}
// 大多数情况返回值是void
//因为需要在res里存放每一次的遍历结果所以输入参数加入res
//因为要返回遍历结果 所以加入res参数 存放返回结果
public void traversalFun(TreeNode node, List<Integer> res) {
//终止条件 (节点为空)
if (node == null) return;
//处理逻辑: 就是把这个节点的值放入结果
traversalFun(node.left, res);
res.add(node.val);
traversalFun(node.right, res);
}
迭代遍历
前序遍历
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if (root == null) return res;
// 1、根(中)节点弹出 压入右节点 压入左节点
// 2、循环上一步骤 实现实际 中 左 右 的弹出顺序
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while (!stack.empty()){
TreeNode pop = stack.pop();
res.add(pop.val);
if (pop.right != null){
stack.push(pop.right);
}
if (pop.left != null){
stack.push(pop.left);
}
}
return res;
}
后序遍历
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if (root == null) {
return res;
}
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while (!stack.isEmpty()) {
TreeNode pop = stack.pop();
res.add(pop.val);
if (pop.left != null) {
stack.push(pop.left);
}
if (pop.right != null){
stack.push(pop.right);
}
}
Collections.reverse(res);
return res;
}
中序遍历
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
if (root == null) {
return result;
}
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = root;
while (cur != null || !stack.isEmpty()) {
if (cur!= null){
stack.push(cur);
cur = cur.left;
}
else {
cur = stack.pop();
result.add(cur.val);
cur = cur.right;
}
}
return result;
}