Binary Tree to DLL | Flatten Binary Tree to Doubly Linked List | DSA-One Course #62

[@AnujBhaiya]

Apologies for the delay in this video, I was working on an exciting new thing which we'll launch soon. Stay tuned and thanks for Supporting 🙌🏻

[@oppoplayer7203]

Bhayia please launch c++ course and how can kids Learn programming and these platforms like whitehatjr are making fool to us by the name of coding

[@mrrishiraj88]

No worries!
We are sure that you always utilise time well.
You take great care of our time as well as of your own time.
Keep on earning love and achieving higher successes!
👍👍

[@SaurabhKumar-oz4gk]

Bhaiya ye dsa complete kab hogga??

[@ismailhossain4730]

Finally after 2 weeks.... thanks for the tutorial. Love from 🇧🇩

[@ashasaideepika1530]

bhaiya i tried this same code in leetcode but for one test case it is showing as found a cycle in the tree what should i do to resolve that issue

[@kalpeshsharma3446]

For every question please give a short brief about iterative, recursively approach, time, space complexity and how much it can be optimize.

[@codetochange8]

Thanks Anuj Bhaiya for this amazing explanation...

[@jayeshkaushik2975]

U r never too late bro, thanks for the intersting videos💯

[@ShadabChoudhary-s8v]

Really nice and easy to understand approach

[@sagarpanwar2724]

Very underrated video. But would have been better if the video contained code as well to cross check

[@biswajitsaha6773]

This is the best solution for Binary Tree to a Doubly Linked List conversion..thank you Anuj Bhaiya for the awesome explanation

[@Sourabh__Chaurasiya]

Ham to anee se hi khush hn

[@prnk139]

good way of teaching!

[@ritikshandilya7075]

great explanation

[@er.skelafahmed]

Eagerly waiting for this bhiya... Please upload 2 videos in a week atleast. Humble request 😀

[@tallalhabib4526]

Excellent Demonstration

[@TheMdaliazhar]

Good explanation.

[@chaitanyashekhardeo4269]

Please jldi course complete kr do. Main aap hi per depend rehta

[@maryamhussain1237]

Haa. Bhaiyya please jaldi course complete kardo

[@jainikprajapati1632]

Thank you for your efforts 😊
Good video

[@9-1939]

That was very simple 👌🔥

[@dongarevikramnarayan179]

nice explanation sir

[@prnk139]

thanks for posting with such an amazing explanation!!

[@ANKITCHAUHAN-do2ug]

thanx for the solution
SO SIMPLE

[@sidharthmak]

Appreciate the video, sir! But in the code you have written a void function but are returning a NULL value in base case. Would be great if you could correct that!

[@atuldwivedi7677]

Thanks a lot Bhaiya 🙏🙏

[@laveshgarg2189]

Amazing video bhaiya maza aa gaya

[@sriramulavenkatakrishnakar9615]

Happy ur return

[@sriramulavenkatakrishnakar9615]

Thought u left course in middle

[@sriramulavenkatakrishnakar9615]

@anuj bhaiya love u 3000

[@arshdeep011]

thanks

[@lofibeats2344]

very well explained

[@reenayadav8468]

Atleast two video one week me upload karo please🙏🙏 it's my humble request sir

[@sainath5131]

Must watch video

[@harshgarg594]

Great content in free
Thanks bhaiya

[@unknown30778]

Make more vedio on tree and graph

[@Manojkumar15629]

Love you bhaiya ❣️

[@rishikeshkumar8652]

Here the binary tree is converted to Doubly linked list in inorder fashion but can we convert it to doubly linked list of pre-order and post-order fashion ? I cannot find the code for the above two ....

[@sagarsondur]

Bhaiya is back!!

[@prnk139]

it is really nice but try to include complexity analyis in the video!

[@Explore_with_anish]

Bro... return type is void but you vare returning null ....it should be only return.

[@PankajSingh-vi3fy]

Exactly... for that you've to pass the prev variable to the recursive function

[@sriramulavenkatakrishnakar9615]

@anuj bhaiyya

[@pinkkitty6553]

void method par null kese return kar sakte hai ??

[@FunnyGamerNo1]

class Solution
{
//Function to convert binary tree to doubly linked list and return it.
Node head, prev;
Node bToDLL(Node root)
{
if(root==null) return null;
bToDLL(root.left);
if(prev==null){
head=root;
prev=root;
// prev=root;
}
else
{
prev.right=root;
root.left=prev;
prev=root;
}
bToDLL(root.right);
return head;
}
}

[@bharatns598]

What is root.left why we using

[@snehaltripathi5763]

GFG solution :
class Solution
{
Node*head = NULL;
Node*prev=NULL;
private:
void convertToDLL(Node*root)
{
if(root==NULL) return;
convertToDLL(root->left);
if(prev==NULL) head = root;
else
{
root->left = prev;
prev->right = root;
}
prev=root;
convertToDLL(root->right);
}

public:
//Function to convert binary tree to doubly linked list and return it.
Node * bToDLL(Node *root)
{
if(root==NULL ) return NULL;
convertToDLL(root);
return head;
}
};

[@KittyMaheshwari]

"bohot easy hai"

[@neelamjoon5095]

but how to print that list now??

[@sumitkanth5349]

Gsoc 2022 pr video bnao from scratch Plzzzz..... Mujhe Javascript aati h

[@Adity853]

Sir yh code run hi nhi kr rha
Aspke karaye huye mostly code run nhi krte

[@Adity853]

Khi na khi error aa hi rhi h

[@baldevgogalyofficial3217]

Void mein aap null return kyun kr rhe ho
'error aa rha h , code run nhi kr rha

[@arpanmaheshwari2290]

Hum first

[@sriramulavenkatakrishnakar9615]

Noo mee

[@sudeeptaadas03]

Where can I solve questions on DSA?

[@codetochange8]

GeekfForGeeks or LeetCode

[@good114]

💕❤️❤️💕

[@ARS_DEVELOPER]

Damn this copyright claim 😑

[@shivanshupandey3637]

❣❣❣❣❣❣❣❣❣

[@sriramulavenkatakrishnakar9615]

@anuj Bhaiya

[@unknown30778]

Make more vedio of tree and graph

[@unknown30778]

Make more vedio of tree and graph

[@unknown30778]

Make more vedio of tree and graph

[@unknown30778]

Make more vedio of tree and graph