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

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

This is the 7th Video on our Linked List Playlist.
In this video we will try to solve another interesting and popular Linked List problem "Convert Sorted List to Binary Search Tree" (Leetcode-382).

Problem Name : Convert Sorted List to Binary Search Tree
Company Tags : Google, Flipkart, Amazon

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

codestorywithMIK

Рекомендации по теме

Комментарии

Simply brilliant! Below is the Java Implementation (TC: O(NlogN) Beats 100%)

class Solution {
public TreeNode sortedListToBST(ListNode head) {

if(head == null) return null;

if(head.next == null) return new TreeNode(head.val);

ListNode slow = head;
ListNode fast = head;
ListNode slow_prev = null;

while(fast != null && fast.next != null) {
slow_prev = slow;
slow = slow.next;
fast = fast.next.next;
}

//slow points to mid
slow_prev.next = null;
TreeNode root = new TreeNode(slow.val);
root.left = sortedListToBST(head);
root.right = sortedListToBST(slow.next);

return root;
}

}

JJ-tpdd

Brother, found your channel randomly and now i'm hooked. Superb teaching 😍.

Whirlwind

Thanks for uploading full explanation. I have improved a lot and my interest to solve problem has also increased.

bhartipatel

Bhai thanku bhai koi doubt ho hi nahi sakta 100% trust hai bhai aap pe

jogindrasingh

Wow seriously I watch only 3 minutes of this video, and understood the complete approach, such beautifully you explain . Coded this myself . Thank you MIK

prateekmohanty

never thought this would be so easy... when GOD of DSA teaches, everything is just a story, , , hats off 2 u
one suggestion, why we are doing the slow_prev->next = NULL, this could had been explained more in depth, like if we dont do it, then middle node will be again considered as a part of BST, i understood this concept, but, someone might had not, if u can please focus/ explain this point of view as well, will be very helpful.

DurgaShiva

Bhaiya aap ka channel gfg ke problem statement ke comment section me randomly mil gaya tha and now i am hooked. Superb Teaching ❤

aatish

Wow you gave your 200% very easy explanation....Thank you very much for such effort..,

abhishekyadav

Amazing Explanation....I haven't seen much people who explain everything as clear as you do. Thanks for making such content :))

ashuthe

All the other playlists are awsome including this…great

SwikarP

Solved this question in O(N) instead of O(NlogN) but used space.
Code:

class Solution {
public:
TreeNode* createBST(vector<int>& nums, int l, int r)
{
if(l<=r)
{
int mid = (l+r)/2;
TreeNode* root = new TreeNode(nums[mid]);

root->left = createBST(nums, l, mid-1);
root->right = createBST(nums, mid+1, r);

return root;
}

return NULL;
}

TreeNode* sortedListToBST(ListNode* head) {
if(head == NULL)
return NULL;

//Storing the LinkedList in a vector
vector<int> nums;

while(head!=NULL)
{
nums.push_back(head->val);
head = head->next;
}

//Calling createBST() & returning the root of created tree.
return createBST(nums, 0, nums.size()-1);
}
};

molyoxide

Bhaiya aap ka 2no graph playlist best hai.
Thanku ❤

aatish

great explanation bhaiya. stack ke histogram and top problem ke bhi video banayiye bhaiya.

_rahulkumar

Learnt a new Thing, Really thanks a ton from bottom of my heart Bro.

molyoxide

Bhaiya please cover graph concepts playlist as well😀

jayanth

I think u will cross many big youtubers one day!! you should launch your own courses or some unique content(like your videos ) . by the way love for your videos.

yashaggarwal

It can be solved in O(N) time and O(logN) space complexity and thats what interviewers will expect.

elakstein

As always great explaination bhaiya.
Just a request can you make a video on "365. water and jug problem" . There is no good explaintion on that problem.
Some people are solving that problem with bfs other are solving with gcd. Just a request whenever you get time please make a video on it.

arjunsolanki

Awesomeee man, one of best explanation

MohdShahrukh-nenc

please also tell 2 pointer approach of this Q's

bhuppidhamii

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

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

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

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

Convert sorted list to binary search tree | Leetcode 109

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

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

Convert Sorted List to Binary Search Tree || Recursion-Tree-Linked List

LeetCode 109 Convert Sorted List to Binary Search Tree

13.1 - Searching & Sorting (2024-11-20)

109. Convert Sorted List to Binary Search Tree - Day 11/31 Leetcode March Challenge

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

Convert Sorted List to Binary Search Tree - Leetcode 109 - Python

109. Convert Sorted List to Binary Search Tree - Day 6/31 Leetcode May Challenge

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

LeetCode 109. Convert Sorted List to Binary Search Tree

109. Convert Sorted List to Binary Search Tree - JAVA (Divide & Conquer - Recursion)

109. Convert Sorted List to Binary Search Tree | O(n) TC | Binary Tree | Linked List |LeetCode Daily

Convert Sorted List to Binary Search Tree | #109 | Leetcode | English

Convert Sorted List to Binary Search Tree | LeetCode 109 | Coders Camp

109 Convert Sorted List to Binary Search Tree with observations and optimized solution

Convert sorted array to binary search tree

Convert Sorted List to Binary Search Tree | For a Better Experience, Watch at 1.5x or 2x Speed.

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

Leetcode 109 [MS/Meta]. Convert Sorted List to Binary Search Tree - slow-fast pointers and recursion