首页 > 代码库 > leetcode--Convert Sorted Array to Binary Search Tree
leetcode--Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 | /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode sortedArrayToBST( int [] num) { return transferHelper(num, 0 , num.length); } /**construct tree node with the help of indices.<br> * @param num --input array * @param i --left index which is included. * @param j --right index which is excluded * @return root node of the tree */ private TreeNode transferHelper( int [] num, int i, int j){ TreeNode root = null ; if (j > i){ if (j == i + 1 ) root = new TreeNode(num[i]); else { int mid = i + (j - i) / 2 ; root = new TreeNode(num[mid]); root.left = transferHelper(num, i, mid); root.right = transferHelper(num, mid + 1 , j); } } return root; } } |
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。