zoukankan      html  css  js  c++  java
  • LeetCode——Convert Sorted Array to Binary Search Tree

    Description:

    Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

    给一个升序有序的数组,构建一个平衡的二叉查找树。

    要平衡就要找中间的数来做头结点,递归构造。

    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public TreeNode sortedArrayToBST(int[] nums) {
            
            if(nums.length == 0) {
                return null;
            }
            
            TreeNode root = createBST(nums, 0, nums.length-1);
            
            return root;
        }
        
        public TreeNode createBST(int[] nums, int left, int right) {
            if(left > right) {
                return null;
            }
            int mid = (left + right) / 2;
            TreeNode node = new TreeNode(nums[mid]);
            node.left = createBST(nums, left, mid-1);
            node.right = createBST(nums, mid+1, right);
            
            return node;
        }
    }

  • 相关阅读:
    微软面试100 题题解
    二元查找树转变成排序的双向链表(树)
    筆試
    PE注入
    内核网络通信
    哈哈哈
    OpenCV 学习
    第一次研究VM程序中的爆破点笔记
    SE2.3.4各试用限制调试笔记
    破解相关书籍
  • 原文地址:https://www.cnblogs.com/wxisme/p/4851178.html
Copyright © 2011-2022 走看看