算法03-二叉树遍历（前中后）

思路：
递归和迭代

题解

public class  Solution{

         public  void  threeOrder(TreeNode root){
                    
                    List<Integer>  list  = new ArrayList<Integer>();
                    preOrder(root,list);
                    inOrder(root,list);
                    postOrder(root,list);
   }

          public void preOrder（TreeNode root , List<Integer> list）{
                              if(null ！= root){
                              list.add(root.val);
                              preOrder(root.left,list);
                              preOrder(root.right,list);
                              }
          }
          public void inOrder(TreeNode root,List<Integer> list){
                           if(null != root){
                           inOrder(root.left,list);
                           list.add(root.val);
                           inOrder(root.right,list);
                           
                           }
          }
          public void postOrder(TreeNode root , List<Interger> list){
                           if(null != root){
                           postOrder(root.left,list);
                           postOrder(root.right,list);
                           list.add(root.val);
                           }
          }
          
}
``