DAY13—二叉树

LeetCode144.二叉树的前序遍历

	public List<Integer> list = new ArrayList<>();
	
    public List<Integer> preorderTraversal(TreeNode root) {
    	if(root==null) {
    		return list;
    	}
    	list.add(root.val);
    	preorderTraversal(root.left);
    	preorderTraversal(root.right);
    	return list;
    }

LeetCode145.二叉树的后序遍历

	public List<Integer> list = new ArrayList<>();

    public List<Integer> postorderTraversal(TreeNode root) {
    	if(root==null) {
    		return list;
    	}
    	postorderTraversal(root.left);
    	postorderTraversal(root.right);
    	list.add(root.val);
    	return list;
    }

LeetCode102.二叉树的层序遍历

	public List<List<Integer>> list = new ArrayList<>();
	
    public List<List<Integer>> levelOrder(TreeNode root) {
    	LinkedList<TreeNode> queue = new LinkedList<>();
    	if(root!=null) {
    		queue.add(root);
    	}
    	
    	while(!queue.isEmpty()) {
    		int size = queue.size();
    		List<Integer> ll = new ArrayList<>();
    		for(int i=0;i<size;i++) {
    			
    			TreeNode temp = queue.remove();
    			ll.add(temp.val);
    			
    			if(temp.left!=null) {
    				queue.add(temp.left);
    			}
    			if(temp.right!=null) {
    				queue.add(temp.right);
    			}
    		}
    		list.add(ll);
    	}
    	return list;
    }

LeetCode107.二叉树的层序遍历

	public List<List<Integer>> list = new ArrayList<>();    
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
    	LinkedList<TreeNode> queue = new LinkedList<>();
    	if(root!=null) {
    		queue.add(root);
    	}
    	
    	while(!queue.isEmpty()) {
    		int size = queue.size();
    		List<Integer> ll = new ArrayList<>();
    		for(int i=0;i<size;i++) {
    			
    			TreeNode temp = queue.remove();
    			ll.add(temp.val);
    			
    			if(temp.left!=null) {
    				queue.add(temp.left);
    			}
    			if(temp.right!=null) {
    				queue.add(temp.right);
    			}
    		}
    		list.add(ll);
    	}
    	
    	Collections.reverse(list);
    	return list;
    }