[LeetCode]Convert Sorted Array to Binary Search Tree

最新推荐文章于 2020-08-07 10:05:40 发布

原创最新推荐文章于 2020-08-07 10:05:40 发布 · 2.5k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

152 篇文章

订阅专栏

本文详细介绍了使用C++将排序数组转换为二叉搜索树的方法，通过递归调用函数实现数组元素到二叉搜索树节点的映射。

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

class Solution {
public:
	TreeNode* Convert2BST(vector<int>& num, int start, int end)
	{
		if(start > end)
			return NULL;
		int mid = (start+end)/2;
		TreeNode* pNode = new TreeNode(num[mid]);
		pNode->left = Convert2BST(num, start, mid-1);
		pNode->right = Convert2BST(num, mid+1, end);
		return pNode;
	}
    TreeNode *sortedArrayToBST(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return Convert2BST(num, 0, num.size()-1);
    }
};

second time

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* sortedArrayToBSTUtil(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 = sortedArrayToBSTUtil(num, start, mid-1);
        root->right = sortedArrayToBSTUtil(num, mid+1, end);
        return root;
    }
    TreeNode *sortedArrayToBST(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return sortedArrayToBSTUtil(num, 0, num.size()-1);
    }
};