建立最小高度二叉樹

給定一個有序數組(遞增)，寫程式構建一棵具有最小高度的二叉樹。

struct Node{int value;Node *left;Node *right;};void createTree(int a[], int begin, int end, Node* &root, Node *parent, bool leftChild){if (begin > end){return;}int mid = begin + (end-begin)/2;Node *p = new Node();p->value = a[mid];if (root == NULL){root = p;}else{    if (leftChild)    {     parent->left = p;    }    else    {    parent->right = p;}}if (begin > mid-1){p->left = NULL;}else{    createTree(a, begin, mid-1, root, p, true);}if (mid+1 > end){p->right = NULL;}else{    createTree(a, mid+1, end, root, p, false);}}