問題 https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/
練習使用JavaScript解答
這個題目的答案並不唯一,因此和測試用例不同也沒關係
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {number[]} nums
* @return {TreeNode}
*/
function funBST(nums, beg, end) {
if(beg > end)
return null;
var mid = Math.floor((beg+end)/2);
var tree = new TreeNode(nums[mid]);
tree.left = funBST(nums, beg, mid-1);
tree.right = funBST(nums, mid+1, end);
return tree;
}
var sortedArrayToBST = function(nums) {
return funBST(nums, 0, nums.length-1);
};