leetcode笔记 107. Binary Tree Level Order Traversal II&108. Convert Sorted Array to Binary Search Tree

leetcode刷题15天
107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
代码：

class Solution {
	public List<List<Integer>> levelOrderBottom(TreeNode root) {
		List<List<Integer>> res = new ArrayList<>();
		int depth = 0;
		traver(res,root,depth);
		Collections.reverse(res);
        return res;
    }
	public void traver(List<List<Integer>> res,TreeNode root,int depth) {
		if(root == null)
			return;
		if(res.size()==depth) {
			List<Integer> temp = new ArrayList<>();
			temp.add(root.val);
			res.add(temp);
		}
		else
		{	
			List<Integer> temp = res.get(depth);
			temp.add(root.val);
			
		}
		traver(res,root.left,depth+1);
		traver(res,root.right,depth+1);
	}
}

108. Convert Sorted Array to Binary Search Tree
     Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:
0
/
-3 9
/ /
-10 5
代码：

class Solution {
    public static TreeNode sortedArrayToBST(int[] nums) {
        return toTree(0,nums.length-1,nums);
        
    }
    public static TreeNode toTree(int start,int end,int[] nums) {
    	if(start>end)
    		return null;
    	int mid = (start+end)/2;
    	TreeNode temp = new TreeNode(nums[mid]);
    	//System.out.println(nums[mid]);
        temp.left = toTree(start,mid-1,nums);
        temp.right =toTree(mid+1,end,nums);
        return temp;
    }
}