108. Convert Sorted Array to Binary Search Tree
来源:互联网 发布:保洁派单软件 编辑:程序博客网 时间:2024/06/05 23:50
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
题目是说将一个排好序的数组变成一个平衡二叉树,那么采用递归的思想就是:
当数组为空,则返回空,当数组长度为1,则返回这一个元素所创造的TreeNode
,当数组长度大于1,那么就将数组分成两个部分,中间的元素作为跟节点,中间元素左边的部分作为左子树,中间元素的右边部分作为右子树,然后两个左右子树再递归调用此函数,最后返回跟节点。
/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } *//** * @param {number[]} nums * @return {TreeNode} */var sortedArrayToBST = function(nums) { if(nums.length==1)return new TreeNode(nums[0]); if(nums.length===0)return null; var halfL=Math.floor(nums.length/2); var root= new TreeNode(nums[halfL]); root.left=sortedArrayToBST(nums.slice(0,halfL)); root.right=sortedArrayToBST(nums.slice(halfL+1)); return root;};
0 0
- 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
- 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
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- /*****/AVL树&红黑树
- Discuz开发之主题表pre_forum_thread的displayorder字段含义
- Unix ls UVA
- VMware虚拟机上网络连接(network type)的三种模式--bridged、host-only、NAT
- 算法导论 练习题 7.1-2
- 108. Convert Sorted Array to Binary Search Tree
- Java类、属性、方法分类及修饰符整合
- 提高篇—调用函数查找数组元素下标(二分法查找)
- PowerShell中借助help寻找自己想要的命令
- python简单验证码识别
- 学习loadrunner过程中遇到的问题
- gpio的工作方式
- Dev 等待提示 WaitDialogForm
- Linux常用命令(1)(欢迎指正,持续更新)