题目:Binary Tree Inorder Traversal
难度:medium
问题描述:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
解题思路:中序遍历二叉树。最最简单的递归即可。
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> res=new ArrayList<>();
inordertravel(root,res);
return res;
}
public void inordertravel(TreeNode root,List<Integer> res){
if(root==null){
return;
}
inordertravel(root.left,res);
res.add(root.val);
inordertravel(root.right,res);
}
}