LeetCode 108. Convert Sorted Array to Binary Search Tree

来源:互联网 发布:项目数据分析师 上海 编辑:程序博客网 时间:2024/05/17 04:47

给定升序数组,构造平衡查找二叉树。


代码:

class Solution {public:    TreeNode *sortedArrayToBST(vector<int> &num)     {    return gao(num, 0, num.size());    }private:TreeNode *gao(vector<int>& num, int begin, int end){if (begin >= end){return NULL;}TreeNode *node = new TreeNode(num[ (end-begin)/2 ]);node->left = gao(num, begin, (end-begin)/2-1);node->right = gao(num, (end-begin)/2+1, end);return node;}};


0 0
原创粉丝点击