java实现二叉遍历-中序1
白话描述:递归
白话实现:递归
public void zhongxubianlihelp1(TreeNode root, List l){
if(root!=null){
if(root.left!=null) zhongxubianlihelp1(root.left,l);
l.add(root.data);
if(root.right!=null) zhongxubianlihelp1(root.right,l);
}
}
public List zhongxubianli1(TreeNode root){
LinkedList<Integer> l=new LinkedList();
zhongxubianlihelp1(root,l);
return l;
}