4.3-有序数组转二叉搜索树

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

建树的时候采用中序遍历，以num[middle]为root。

#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 *createTree(int *num, int left, int right)
{
    if (left > right)
        return NULL;

    int mid = (left + right) / 2;
    TreeNode *node = new TreeNode(num[mid]);
    node->left = createTree(num, left, mid - 1);
    node->right = createTree(num, mid + 1, right);
    return node;
}
TreeNode *sortedArrayToBST(int *num, int size)
{
    createTree(num, 0, size - 1);
}
void showTree(TreeNode *root)
{
    if(root!=NULL)
    {
        showTree(root->left);
        cout<<root->val<<" ";
        showTree(root->right);
    }
}
int main()
{
    int num[]={1,2,3,4,5,6,7,8,9};
    TreeNode *root = sortedArrayToBST(num,9);
    showTree(root);
    return 0;
}