一、题目
二、代码
/**
* 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
{
List<Integer> re;
public List<Integer> inorderTraversal(TreeNode root)
{
re = new LinkedList<>();
if(root == null) return re;
recursion(root);
return re;
}
void recursion(TreeNode cur)
{
if(cur.left!=null) recursion(cur.left);
re.add(cur.val);
if(cur.right!=null) recursion(cur.right);
}
}