Problem Description
[https://leetcode.com/problems/binary-tree-inorder-traversal/]
Given a binary tree, return the inorder traversal of its nodes’ values.
思路
本来刚刚做完一题想撤来着,pick one 了这个!!!
F! pick one 有毒!!!!
Code
package q094;
import java.util.ArrayList;
import java.util.List;
import TreeNode.*;
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> ans = new ArrayList<Integer>();
helper(root, ans);
return ans;
}
public void helper(TreeNode root, List<Integer> list) {
if (root == null)
return;
helper(root.left, list);
list.add(root.val);
helper(root.right, list);
}
}