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

Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

[@ethicalgaming4349]

Note :- Pass the vector by reference to avoid vector copy in each recursive call.

[@vibhavsharma2724]

Very nice explanation. Thanks🙏🏻

[@zeyadalbadawy2245]

the best explaination ever !!

[@anaranyabose]

Great one!

[@masumali8356]

You are the best....masum

[@informative180]

di, u r best..🧡🧡

[@santhoshsiva281]

I literally feel fucked up when i didn't get the intution behind this problem.After saw this video i feel good.. You are my lifesaver ❤️

[@adityapatil9215]

Easy explanation 🙌

[@maddycoder1294]

nice explanation

[@amishajha24]

what is the time complexity

[@devbhattacharya153]

Thnaks a lot didi :)

[@baazigaraxcode4994]

Love uhh mam ❤️

[@BHARATKUMAR-jl1jp]

why this algorithm is working any intuition behind this...?

[@ritendrasinghbhadauriya1643]

Great!

[@maragmodh9831]

it is not accepted in gfg when the input is 2 i.e. 2 nodes are there please give solution for it

[@girishsudhakar1099]

Great Explaination Thanks!

[@reshmaparveen6679]

Great explanation ❤️❤️

[@motivationtipsknowledge813]

Vector m store karke thodi na karna hai madam

[@SamsIt-hi9gf]

😁😁 mai wahi soch raha hu

[@technosujeet]

its doesn't seems the optimal solution since you are using extra space

[@sauravchandra10]

Can we do this without using extra space?

[@tanishq2766]

No imo

[@sahilbani7020]

easy explanation loved it but takes 416ms of runtime compared to 13ms of top solution and 360mb of memory consumed a better approach would be using slow and fast pointer method to find the middle of the linked list thanks for this video TreeNode* fun(ListNode* l, ListNode* r) { ListNode *s=l, *f=l; if(l==r) return NULL; while(f!=r && f->next!=r) { s=s->next; f=f->next->next; } TreeNode* t=new TreeNode(s->val); t->left=fun(l,s); t->right=fun(s->next,r); return t; } TreeNode* sortedListToBST(ListNode* head) { if(head==NULL) return NULL; if(head->next==NULL) return new TreeNode(head->val); return fun(head, NULL); }

[@ethicalgaming4349]

You can reduce this time(416ms to 32ms) if u pass the vector by reference.

[@sahilbani7020]

@@ethicalgaming4349 yes bro but creating a vector will take space complexity of O(N), you can simply manipulate your list by slow and fast pointers as mentioned in my code

[@priyanshubora1938]

noice

[@user-xg7hi5mh3g]

Great Video thank u so much for your Efforts& time . How to implement this in c# The first part when i get defined the node from this recursiv method ..?