1 解题思想
二叉树的中序遍历,做法都是基本做法,这里不做特别说明
最近有点忙,更新会断断续续。。
2 原题
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].
3 AC解
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public void helper(List<Integer> list,TreeNode node){
if(node.left!=null)
helper(list,node.left);
list.add(node.val);
if(node.right!=null)
helper(list,node.right);
}
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result=new ArrayList<Integer>();
if(root!=null)
helper(result,root);
return result;
}
}