递归算法代码记录:
public List<Integer> preorderTraversal(TreeNode root) {
if(root==null){
return new ArrayList();
}
List<Integer> resultList
递归算法代码记录:
public List<Integer> preorderTraversal(TreeNode root) {
if(root==null){
return new ArrayList();
}
List<Integer> resultList