zoukankan      html  css  js  c++  java
  • LintCode: Convert Sorted Array to Binary Search Tree With Minimal Height

    C++

    复制代码
    /**
     * Definition of TreeNode:
     * class TreeNode {
     * public:
     *     int val;
     *     TreeNode *left, *right;
     *     TreeNode(int val) {
     *         this->val = val;
     *         this->left = this->right = NULL;
     *     }
     * }
     */
    class Solution {
    public:
        /**
         * @param A: A sorted (increasing order) array
         * @return: A tree node
         */
        TreeNode *sortedArrayToBST(vector<int> &A) {
            // write your code here
            if (0 == A.size()) {
                return NULL;
            }
            return buildTree(A, 0, A.size()-1);
        }
        TreeNode *buildTree(vector<int> &A, int from, int to) {
            if (from > to) {
                return NULL;
            }
            int mid = (from+to)/2;
            TreeNode *node = new TreeNode(A[mid]);
            node->left = buildTree(A, from, mid-1);
            node->right = buildTree(A, mid+1, to);
            return node;
        }
    };
    复制代码

     

    本文转自ZH奶酪博客园博客,原文链接:http://www.cnblogs.com/CheeseZH/p/5000037.html,如需转载请自行联系原作者

  • 相关阅读:
    springMvc
    计算机网络
    Mybatis 总结
    Spring 面试总结
    Java IO 流
    自定义类加载器
    缓存一致性协议
    dfs、bfs序
    7.26
    Trick
  • 原文地址:https://www.cnblogs.com/twodog/p/12138707.html
Copyright © 2011-2022 走看看