题目描述:给定一个二叉树的根节点 root
,返回 它的 中序 遍历 。
编码实现:
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
recursion(root, result);
return result;
}
public void recursion(TreeNode root,List<Integer> list) {
if (root == null){
return;
}
recursion(root.left,list);
list.add(root.val);
recursion(root.right,list);
}
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;
}
}