LeetCode 109:Convert Sorted List to Binary Search Tree

最新推荐文章于 2024-10-15 19:28:18 发布

dcl_sjtu

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量302

点赞数

分类专栏：算法 LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/dcl_sjtu/article/details/52115791

版权

算法同时被 2 个专栏收录

3 篇文章 0 订阅

订阅专栏

LeetCode

2 篇文章 0 订阅

订阅专栏

题目：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 从给定的有序链表生成平衡二叉树。

分三步：
1. Get the number of nodes获取链表大小n
2. make a balanced tree. (pre-order, bfs) 构造n个节点的平衡树
3. assign values. (in-order, dfs) 赋值

每步均为O(n) time

第2步需要 O(n) sapce

class Solution {
public:
    TreeNode* sortedListToBST(ListNode* head) {
        int len=0;
        ListNode *p=head;
        while(p){
            len++;
            p=p->next;
        }
        if(len==0) return NULL;
        TreeNode* root=makeTree(len);
        inorder(root,head);
        return root;
    }
    
    TreeNode* makeTree(int n){
        TreeNode *root=new TreeNode(0);
        queue<TreeNode*> q;
        q.push(root);
        n--;
        while(true){
            if(n==0) break;
            TreeNode *x=q.front();
            q.pop();
            x->left=new TreeNode(0);
            q.push(x->left);
            n--;
            if(n==0) break;
            x->right=new TreeNode(0);
            q.push(x->right);
            n--;
            if(n==0) break;
        }
        return root;
    }
    
    ListNode* inorder(TreeNode* root,ListNode* node){
        if (root->left != NULL) 
            node = inorder(root->left, node);
        root->val = node->val;
        node = node->next;
        if (root->right != NULL) 
            node = inorder(root->right, node);
        return node;
    }
};