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) {
//中序遍历 左根右
//1、递归实现
List<Integer> list = new ArrayList<>();
inorder(root, list);
return list;
}
public void inorder(TreeNode node, List<Integer> list){
//判空 如果为空,相当于遇到叶子结点,则返回
if(node == null){
return;
}
//遍历左节点
inorder(node.left, list);
//遍历根节点 加入list中
list.add(node.val);
//遍历右节点
inorder(node.right, list);
}
}
2、迭代实现(DFS)
/**
* 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) {
//2、迭代 (dfs)
//需要使用一个栈
List<Integer> list = new ArrayList<>();
Deque<TreeNode> stack = new LinkedList<>();
while(root!=null || !stack.isEmpty()){ //当根节点不为空或栈不为空时
while(root!=null){ //当根节点非空时
stack.push(root); //压入栈中
root = root.left; //因为是中序遍历,因此遍历左节点
}
//当根节点为空 说明遍历到叶子结点的左节点或者右节点
root = stack.pop(); //弹出栈顶元素作为根节点(回溯)
list.add(root.val); //并加入到结果集中(遍历到空节点,那么按照左根右的顺序,将根节点加入结果集)
root = root.right; //遍历右节点
}
return list;
}
}