LeetCode: Convert Sorted Array to Binary Search Tree [108]
来源:互联网 发布:知乎必须用手机注册吗 编辑:程序博客网 时间:2024/05/16 17:41
【题目】
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
【题意】
给定一个已排序的数组(不存在重复元素),将它转换成一棵平衡二叉搜索树。【思路】
则使用二分法来解本题即可。
【代码】
/** * 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 *build(vector<int>&num, int low, int high){ if(low>high)return NULL; int mid = (low+high)/2; //生成根节点 TreeNode*root=(TreeNode*)malloc(sizeof(TreeNode)); root->val=num[mid]; //生成左子树 TreeNode*left=build(num, low, mid-1); //生成右子树 TreeNode*right=build(num, mid+1, high); //构造二叉树 root->left=left; root->right=right; return root; } TreeNode *sortedArrayToBST(vector<int> &num) { int size=num.size(); if(size==0)return NULL; return build(num, 0, size-1); }};
0 0
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- LeetCode 108: Convert Sorted Array to Binary Search Tree
- LeetCode(108)Convert Sorted Array to Binary Search Tree
- LeetCode 108 Convert Sorted Array to Binary Search Tree
- LeetCode: Convert Sorted Array to Binary Search Tree [108]
- LeetCode 108 Convert Sorted Array to Binary Search Tree
- [leetcode 108] Convert Sorted Array to Binary Search Tree
- leetcode || 108、Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree - LeetCode 108
- [Leetcode 108, Meidum] Convert Sorted Array to Binary Search Tree
- leetcode[108]:Convert Sorted Array to Binary Search Tree
- LeetCode(108) Convert Sorted Array to Binary Search Tree
- Leetcode# 108 Convert Sorted Array to Binary Search Tree
- [leetcode-108]Convert Sorted Array to Binary Search Tree(java)
- leetcode 108: Convert Sorted Array to Binary Search Tree
- LeetCode(108) Convert Sorted Array to Binary Search Tree
- LeetCode 108: Convert Sorted Array to Binary Search Tree
- Android输入法扩展之远程输入法
- 升了osx10.10后cocoapods用不了的解决方法
- 【足迹C++primer】19、构造函数再探
- Android自动化测试初探(一): 捕获Activity上的Element
- 自学第六天
- LeetCode: Convert Sorted Array to Binary Search Tree [108]
- LeetCode: Convert Sorted List to Binary Search Tree [109]
- Linux环境编程之IPC进程间通信(三):FIFO
- LeetCode: Balanced Binary Tree [110]
- LeetCode: Minimum Depth of Binary Tree [111]
- 保存,读取,状态切换
- leetcode_Longest Palindromic Substring
- 【oracle form】开发中用到的一些东西
- 6_leetcode_Palindrome Number