Tree Data Structure using Python

[@codingcart]

I have explained the whole code in 2nd lecture. If anyone is facing issue in this 1st lecture code please use the below code, add return statement when the node is None. if node is None: return self.createNode(data)

[@malyalasaiphaneendra6172]

I'm a beginner and trying hard to solve a leetcode problem regarding trees. But I don't have idea how a tree is constructed. Your explanation gave me complete structure of tree..... Thanks a lot for step by step explanation

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@saikrishnadamacharla9444]

just no words...I was struggling to create tree from past 2 days... And today, I got understood by your explanation. Thank you brother

[@codingcart]

Glad it helped!

[@manishyadav9169]

Finally got a best teacher on u tube

[@aishwaryaranghar3385]

THIS VIDEO IS SOOOOOOO GOOOD!!!!!!! this solved my problems that couldnt be solved from other yt videos, thankss

[@abdullahmahi4490]

I am watching from USA. Dada you explain very well. I went on other youtube channel, but didn't understand and came back to you

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@shivambalajee2646]

The most detailed explanation available online, for a tree implementation.

[@codingcart]

Cool😎 do share with your friends too 🙂

[@clutchyt5610]

I don't generally comment, but you're really amazing! Thankyou for clearing my concepts. Love to see more videos on DSA Python.

[@codingcart]

Glad to hear that 😊

[@mishuksarker213]

I hope this is very easy to understanding tree data structure .Thanks a lot...........

[@codingcart]

Glad to hear that

[@HarSH-ub2ng]

If you didn't get it in first time, watch it again I got to know this information after wasting my 1 week 😢

[@sharifmansuri607]

Hi this is the best explanation on BST, thanks for this video

[@codingcart]

Glad it was helpful!

[@vikash.official]

Like the way how you teach👌🏻

[@codingcart]

Glad you think so!

[@user-vt7kt6ny3o]

very helpful thanks

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@hendrag593]

Thanks, this is one of the best video to learn about tree creation using Python...

[@codingcart]

Glad you liked it

[@MEHEDIHASSAN-lx5rx]

Best explained video i have ever seen

[@paruluniyal2305]

Great job 👏👍👏

[@codingcart]

Thank you! 😃

[@HimanshuSingh-gs5fg]

Thanks, bro... your explanation is best for beginners in data structure like me

[@codingcart]

Glad to hear that

[@vishnutejakatta8056]

Superbly Explained bruh!!

[@codingcart]

Glad you liked it

[@satyamsrivastava3024]

Best explanation ever!! Thank you so much Sir for enlightening us 🙌❤️

[@satyamsrivastava3024]

Marvelous Explanation Sir. Just a humble request. I want to excel in card games such as- Bluff, Court piece, etc. Please post a tutorial on its algorithm. It'll be both fun & informative. Thanks.

[@Binary__]

Easy explanation !! 😍

[@codingcart]

Glad you liked it

[@vipuldogra6600]

very well explained. Thank you!

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@mdrizwan4631]

Great Video

[@codingcart]

Glad you enjoyed it

[@zafdell8170]

Superb awesome explanation

[@quanduong3390]

very easy to follow. Thank you so much for making this video. Best wish to you.

[@codingcart]

Glad to hear that 🤗. Please share with your friends too 🙂

[@bhubeshsr6281]

U will succeed sir one day

[@codingcart]

Thanks Bhubhesh for your kind words.

[@sahilbisht3661]

Awesome explanation 👌

[@codingcart]

Thank you 🙂

[@bhubeshsr6281]

Hardworker!!

[@codingcart]

:)

[@yogeshety1803]

Loved it broo👍 ....I ll keep watching you videos😁

[@codingcart]

Glad to hear that

[@ashwinkrishnan1287]

Thanks you for this amazing explanation

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@kalpanasharma5000]

thanks alot .its really useful one

[@codingcart]

Thanks 😊 Do watch the linked list videos too😊

[@venkatkrishnan9777]

It is very helpful bro

[@codingcart]

Glad to hear that😊 Please do share with your friends too 😉

[@astrobullivant5908]

Why is there a separate Node class when the Tree class doesn't even have a constructor?

[@charoonigam3135]

Thank you sir. This was helpful.

[@codingcart]

Glad you liked it 😊. Do share with your friends too 🙂

[@varunajmera]

super tut

[@adritaanwar2279]

good job!

[@codingcart]

Thanks!

[@faris.abuali]

Thanks

[@optimistichomosapien7484]

Great explanation ❤️

[@iamfakeone7679]

thank you so much brother

[@codingcart]

Glad you liked it 😊. Do share with your friends too 🙂

[@naturemusic2285]

Nice sayender

[@codingcart]

:)

[@nikitajaiswal6386]

Amazing

[@dejvyd9323]

great vid, dude

[@codingcart]

Glad you enjoyed it

[@jeanalbertcortesortiz6761]

Teacher, could you teach us with a N-ary tree? Please

[@anuraglpu]

Thank you very much.

[@codingcart]

Welcome 😊

[@ibrahimnazari8376]

Thank you

[@codingcart]

You can start linked list with simple problem :) kzbin.info/www/bejne/eZ-rZWukorpreKs kzbin.info/www/bejne/oprXgnt9h7eGmtE kzbin.info/www/bejne/bWLPnaaVrZmJmrs kzbin.info/www/bejne/eqnZdodqarx0nac kzbin.info/www/bejne/pV7Fn52pjpd7mc0

[@karandhage7891]

love you brooo!!

[@sainithinreddy6633]

Thankyou so much bro 😁

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@techmentos]

You. have not initialised node any where. Can u plz explain more about node is None .

[@SatyendraJaiswalsattu]

It's initialized in the beginning, you can check the Node class constructor.

[@RiyaBhawsar-b9i]

@codingcart can you please share link of linkedlist and array here, i can not find that.

[@codingcart]

LinkedList kzbin.info/aero/PLPdtS77PaSutcdxM6FfjfbpW8GiBw-QzL

[@pardeep657]

is node a variable or instance? node.left is a variable and we are assigning Node(data) to it..howz that possible? Node(data) has 3 variables

[@SatyendraJaiswalsattu]

It's a instance, please have a look to class Node you will get it. Also visit part 2 of this lecture it will clear your all doubts.😊

[@tanmaysatsangi131]

Please explain, in line 9 of code what does Node(data) mean???

[@Maxtron]

he passed value to the contsructor

[@tanmaysatsangi131]

@@Maxtron Thanks

[@subrotomukherjee8571]

Hello sir.🙌🙌

[@codingcart]

Hello there!

[@Death-metal99]

underrated

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@smitnikumbh6572]

15:55

[@adritaanwar2279]

I didn't understand why "return node" is returning the very first node every time because the node value is changing at every recursion. Someone please help.

[@codingcart]

Coz the head node should be kept hinged, suppose you are going to iterate through the list and if you don't have the head node then how will you proceed. So for going for any operation we have to start with head only. That's why head is kept hinged or safe.😊

[@adritaanwar2279]

@@codingcart Actually I understood why the head node is hinged. My question is how is it hinged since the node value changes in the recursive process.

[@codingcart]

Each time new node is added to their respective position by going through condition check, head node is not being changed. Just take few inputs and dry run on paper you will get this one.if you still face problem you can ping on whatsapp 😊

[@adritaanwar2279]

@@codingcart Finally got it! Thanks for explaining this topic beautifully!

[@noobcodersgang3991]

Your code doesnt works

[@codingcart]

It's the part 1 where I have explained only basic ..checkout the next part you will get it 😊

[@noobcodersgang3991]

@@codingcart no its showing it had no attirbute type data

[@codingcart]

Share your code

[@noobcodersgang3991]

@@codingcart class Node: def __init__(self,data): self.right = None self.data = data self.left = None class Tree: def createNode(self,data): return Node(data) def insert(self,node,data): if node is None: self.createNode(data) if data < node.data: node.left = self.insert(node.left,data) else: node.right = self.insert(node.right,data) return node t = Tree() root = t.createNode(5) t.insert(root,10)

[@codingcart]

@@noobcodersgang3991 i have explained in the next session code. anyway you can add return statement in condition if node is None. if node is None: return self.createNode(data)

[@shahsikalagowda183]

Output sir

[@jeevankumar2486]

too many ads

[@bhargavamara1902]

fantastic

[@chandrakantdubey2821]

Great video