LeetCode108 Convert Sorted Array to Binary Search Tree
来源:互联网 发布:淘宝网皮箱 编辑:程序博客网 时间:2024/06/07 19:22
题目链接:
https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
题目描述:
根据一个递增的序列建一个二叉查找树。
题目分析:
先建好一个根节点,再根据根节点递归的划分左右子树进行建树。
代码:
void createBST(struct TreeNode **root,int* nums,int len){ if(len<=0){ return; } int idx=len/2; *root=(struct TreeNode*)malloc(sizeof(struct TreeNode*)); (*root)->val=nums[idx]; (*root)->left=(*root)->right=NULL; createBST(&((*root)->left),nums,idx); createBST(&((*root)->right),nums+idx+1,len-idx-1); }struct TreeNode* sortedArrayToBST(int* nums, int numsSize) { struct TreeNode* root=NULL; createBST(&root,nums,numsSize); return root;}
0 0
- LeetCode108 Convert Sorted Array to Binary Search Tree
- LeetCode108—Convert Sorted Array to Binary Search Tree
- leetcode108. Convert Sorted Array to Binary Search Tree
- LeetCode108. Convert Sorted Array to Binary Search Tree
- [LeetCode108]Convert Sorted Array to Binary Search Tree
- leetcode108~Convert Sorted Array to Binary Search Tree
- Leetcode108——Convert Sorted Array to Binary Search Tree
- LeetCode108 Convert Sorted Array to Binary Search Tree
- [leetcode108]Convert Sorted Array to Binary Search Tree
- leetcode108. Convert Sorted Array to Binary Search Tree
- LeetCode108. Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- RCNN SPP_net
- C++中引用与指针的区别(详细介绍)
- 对handler机制的回答
- 用mysql实现类似于oracle dblink的功能
- 验证框架的配置及validation.xml常用的验证规则
- LeetCode108 Convert Sorted Array to Binary Search Tree
- 地图需要改的参数
- npm常用命令
- 装饰模式
- 【面试题】N级台阶(比如100级),每次可走1步或者2步,求总共有多少种走法?
- 一次 TableView 性能优化经历
- linux sdio wifi驱动编译
- JDBC之打通数据库
- 过滤器Filter高级应用