原题: https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
一、题目要求
给定一个二叉树的根节点 root
,返回它的 中序 遍历。
示例 1:
输入:root = [1,null,2,3] 输出:[1,3,2]
示例 2:
输入:root = [] 输出:[]
示例 3:
输入:root = [1] 输出:[1]
示例 4:
输入:root = [1,2] 输出:[2,1]
示例 5:
输入:root = [1,null,2] 输出:[1,2]
提示:
- 树中节点数目在范围
[0, 100]
内 -100 <= Node.val <= 100
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
二、解题
package com.leetcode.test.tree;
import java.util.ArrayList;
import java.util.List;
public class Solution12 {
public static void main(String[] args) {
TreeNode a1 = new TreeNode(1);
TreeNode a2 = new TreeNode(2);
TreeNode a3 = new TreeNode(3);
a1.right = a2;
a2.left = a3;
System.out.println(inorderTraversal(a1));
}
public static List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList();
inorderTraversal2(list, root);
return list;
}
public static void inorderTraversal2(List<Integer> list, TreeNode node){
if (node == null) {
return;
}
if (node.left == null && node.right == null) {
list.add(node.val);
return;
}
inorderTraversal2(list, node.left);
list.add(node.val);
inorderTraversal2(list, node.right);
}
}