二叉树

题目一：二叉树的先序遍历，中序遍历，后序遍历 ，层遍历。

思路：分别用递归和非递归实现。

题目二：输入一颗二叉树的跟节点和一个整数，打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。(注意: 在返回值的list中，数组长度大的数组靠前)

思路：先从跟节点遍历到叶子节点。判断该路径是否等于target

题目三：二叉搜素树的后序遍历

题目四：求二叉树的深度

思考:递归 left=treeDepth(root.left)  right=treeDepth(root.right)  return left>right?left+1:right+1

题目五：平衡二叉树

思考：条件 左右节点高度小于等于1

public static void preOrder1(Tree head){
    	if(head==null){
    		return ;
    	}
    	System.out.print(head.value+" ");
    	preOrder1(head.left);
    	preOrder1(head.right);
    }
    
    public static void inOrder1(Tree head){
    	if(head==null){
    		return ;
    	}
    	inOrder1(head.left);
    	System.out.print(head.value+" ");
    	inOrder1(head.right);
    }
    
    public static void postOrder1(Tree head){
    	if(head==null){
    		return ;
    	}
    	postOrder1(head.left);
    	postOrder1(head.right);
    	System.out.print(head.value+" ");
    }
    
    public static void preOrder2(Tree head){
    	
    	System.out.print("pre-order: ");
    	if(head!=null){
    		Stack<Tree> stack=new Stack<Tree>();
    		stack.add(head);
    		while(!stack.isEmpty()){
    			head=stack.pop();
    			System.out.print(head.value+" ");
    			if(head.right!=null){
    				stack.push(head.right);
    			}
    			if(head.left!=null){
    				stack.push(head.left);
    			}
    		}
    	}
    	System.out.println();
    }
    
    public static void inOrder2(Tree head){
    	System.out.print("in-order: ");
    	if(head!=null){
    		Stack<Tree> stack=new Stack<Tree>();
    		//stack.add(head);
    		while(!stack.isEmpty()||head!=null){
    			if(head!=null){
    				stack.push(head);
    				head=head.left;
    			}else{
    				head=stack.pop();
    				System.out.print(head.value+" ");
    				head = head.right;
    			}
    		}
    	}
    	System.out.println();
    }
    
    public static void posOrder2(Tree head){
    	System.out.print("pos-order: ");
    	if(head!=null){
    		Stack<Tree> stack1=new Stack<Tree>();
    		Stack<Tree> stack2=new Stack<Tree>();
    		stack1.add(head);
    		while(!stack1.isEmpty()){
    			head=stack1.pop();
    			stack2.push(head);
    			if(head.left!=null){
    				stack1.push(head.left);
    			}
    			if(head.right!=null){
    				stack1.push(head.right);
    			}
    		}
    		while(!stack2.isEmpty()){
    			System.out.print(stack2.pop().value+" ");
    		}
    	}
    	System.out.println();
    }

 

public ArrayList<ArrayList<Integer>> FindPath(TreeNode root,int target) {
	 ArrayList<ArrayList<Integer>> pathlist=new ArrayList<ArrayList<Integer>>();
	
	 Stack<Integer> path =new Stack<Integer>();
	 findPath(root,target,pathlist,path);
	 return pathlist;
        
    }

   public  void findPath(TreeNode root,int target, ArrayList<ArrayList<Integer>> pathlist,Stack<Integer> path) {
	   if(root==null){
			 return ; 
		 }
	if(root.left==null&&root.right==null){
		if(root.val==target){
			ArrayList<Integer> list =new ArrayList<Integer>();
			for(int value:path){
				list.add(value);
			}
			list.add(root.val);
			pathlist.add(list);
		}
	}else{
		path.add(root.val);
		findPath(root.left,target-root.val,pathlist,path);
		findPath(root.right,target-root.val,pathlist,path);
		path.pop();
	}
	
}
}