Convert Sorted List to BST | LeetCode 109 | Google Coding Interview Question

preview_player
Показать описание


#leetcode #datastructure #algorithm #coding #codinginterview #googlecodinginterview
  1. EazyAlgo
Рекомендации по теме
Convert Sorted List 0:09:50

Convert Sorted List to BST | LeetCode 109 | Google Coding Interview Question

Leetcode - Convert 0:05:25

Leetcode - Convert Sorted List to Binary Search Tree (Python)

Convert Sorted List 0:05:33

Convert Sorted List to BST | Leetcode #109 | Trees #15

Convert Sorted List 0:22:29

Convert Sorted List to Binary Search Tree | Google | Flipkart | Amazon | Leetcode 109

109. Convert Sorted 0:17:45

109. Convert Sorted List to Binary Search Tree || Code + Explanation + Example Walk through

Convert Sorted Array 0:09:54

Convert Sorted Array to Binary Search Tree - Leetcode 108 - Python

Build Balanced BST 0:11:30

Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

LeetCode 109. Convert 0:13:53

LeetCode 109. Convert Sorted List to Binary Search Tree

Speedrunning Neetcode's Leetcode 1:44:49

Speedrunning Neetcode's Leetcode List (Trees)

Sorted Link List 0:12:05

Sorted Link List to BST | GeeksforGeeks Problem of The Day | Leetcode 109.

Convert Sorted Array 0:09:05

Convert Sorted Array to Binary Search Tree (LeetCode 108. Algorithm Explained)

Convert sorted array 0:05:39

Convert sorted array to binary search tree

Flatten Binary Tree 0:14:27

Flatten Binary Tree to Linked List - Leetcode 114 - Python

Build A Min 0:06:55

Build A Min Height BST From A Sorted Array | Coding Interview Question

Convert Sorted List 0:18:43

Convert Sorted List to Binary Search Tree (BST) | LeetCode 109 | C++, Java, Python

Lecture 71: Binary 0:48:19

Lecture 71: Binary SearchTree FAANG Interview Questions || Part-2

L38. Flatten a 0:21:51

L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java

Sorted Link List 0:16:59

Sorted Link List to BST | Problem of the Day : 07 / 06 /22 | Siddharth Hazra

Leetcode 108, 109. 0:29:21

Leetcode 108, 109. Create BST from sorted list

12.a) Construct balanced 0:15:23

12.a) Construct balanced bst from sorted linked list

Convert Sorted List 0:10:46

Convert Sorted List to Binary Search Tree | Leetcode 109 | BST

Convert Sorted Array 0:04:42

Convert Sorted Array to BST | Leetcode - 108 | Trees #14

[Java] Leetcode 108. 0:05:53

[Java] Leetcode 108. Convert Sorted Array to Binary Search Tree [Binary Search Tree #1]

Sorted List To 0:15:39

Sorted List To Balanced Binary Search Tree | Sorted Linked List To BST

Комментарии
Автор

same approach as 108 Leetcode, but it's great idea :) Thanks

voquangaiviet
Автор

please check this, I'm getting error

TreeNode* sortedListToBST(ListNode* head) {
ListNode* slow=head;
ListNode*fast=head;
if(head==NULL){
return NULL;
}
if(head->next==NULL){
return new TreeNode(head->val);
}
while(fast!=NULL && fast->next!=NULL){
fast=fast->next->next;
slow=slow->next;
}
TreeNode*ans=new TreeNode(slow->val);



return ans;

}

halchal
Автор

hey thank you for the video. can you explain again why mid.next needs to be null? wont the mid be re-declared at every recursion?

yanchengpan
Автор

class Solution {
public:

TreeNode* sortedListToBST(ListNode* head) {
//base cases:
if(head==NULL) return NULL;
if(head->next==NULL) return new TreeNode(head->val);
ListNode* prev= NULL;
ListNode* slow=head;
ListNode* fast=head;
ListNode* mid=NULL;
while(fast != NULL && fast->next != NULL) {
fast=fast->next->next;
prev=slow;
slow=slow->next;

}
mid= slow;
prev->next=NULL;
TreeNode* root= new TreeNode(mid->val);
root->left= sortedListToBST(head);
root->right= sortedListToBST(mid->next);

return root;

}
};

SadhanaSharma