题目
给定一个二叉树的根节点root,返回它的中序遍历。
示例
输入:root = [1,null,2,3]
输出:[1,3,2]
输入:root = []
输出:[]
输入:root = [1]
输出:[1]
解决方案
方法一:递归
传统的遍历算法,根据访问顺序依次访问中左右(前序),左中右(中序),左右中(后序)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
if(root == null) {
return result;
}
// 访问左子树
List<Integer> leftList = inorderTraversal(root.left);
if(leftList != null && leftList.size() != 0) {
result.addAll(leftList);
}
// 访问根节点
result.add(root.val);
// 访问右子树
List<Integer> rightList = inorderTraversal(root.right);
if(rightList != null && rightList.size() != 0) {
result.addAll(rightList);
}
return result;
}
}
方法二:栈(在LeetCode的题解中又叫迭代)
这个方法的代码很容易 “一看就懂,一些就废”,尽量自己写一遍
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
// ArrayDeque适合随机访问,LinkedList适合插入删除元素
Deque<TreeNode> stack = new LinkedList<>();
// root==null表示遍历到了叶节点,stack为empty表示整棵树都遍历过了
while(root != null || !stack.isEmpty()) {
// 先一直push左子树
while(root != null) {
stack.push(root);
root = root.left;
}
// root为null表示到了叶节点的子节点,需要往上返回
// 把当前节点的父节点从栈里pop出来
root = stack.pop();
result.add(root.val);
// 访问右子树
root = root.right;
}
return result;
}
}