Q4.3 Convert a sorted array to a binary tree

Q:Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.

A:DFS问题 

找到array的中点，作为树的根节点。start~mid-1构成其左子树， mid+1~end构成其右子树。这样不断递归下去。

#include <iostream>
#include <vector>
using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

TreeNode *sortedArrayToBST(vector<int> &num) {
    const int n = num.size();
    if (n == 0) {
        return NULL;
    }
    TreeNode *root;
    return dfs(num,0,n);
    }
TreeNode *dfs(vector<int> &num, int start, int end) {
    if (start == end) {
        return NULL;
    }
    int mid = start + (end-start)/2;
    TreeNode *root = new TreeNode(num[mid]);
    root->left = dfs(num, start, mid);
    root->right = dfs(num, mid+1, end);
    return root;
}

int main() {
	vector<int> a;
	for (int i = 0; i < 10; i++) {
		a.push_back(i);
	}
	TreeNode *root = sortedArrayToBST(a);
	return 0;
}