Binary Tree in Data Structures | All about Binary Tree | DSA Course

Hi Shraddha, I've a question here regarding 'count nodes' problem. Counting number of nodes using recursion and level order (using queue) both runs in O(n) time but then why in actual level order takes less time then recursion when submitting the problem be it leetcode, codechef or any other coding platform?

For eg - Tree -> [1,2,3,4,5,6]
Time with Recursion - 28 ms and time with level order - 16 ms

sabhi mere comment ko like ko

Please add timestamps so that people can navigate easily

Can I watch this for C data structures also ??

Mam can u please explain in english we tamilnadu students can understand.please mam🥺

shraddha di plz yaar yehi course c programming ke saath kaise karna ik video bano di yaar plzzz......

in second approch of calculating diameter of tree i think you have consider a wrong height of last node 4

Hi mama
My small request is can you make video on all leetcode problem in java using DSA with full explanation
please mam

Mam is it compulsory to work on live projects before any internship or interview

In diameter ques diam3=height(root.left)+height(root.right); bcoz we are counting edges in this ques and height basically gives us no. of nodes so we don't need to add 1 to it.

in the buildTree function what will be the recursion exit condition?
I am getting ArrayIndexOutOfBoundException

Mam ik PHP ki vedio bna do or ik frame work add kar dena

you didn't told the kth level for which we should tell the right answer

If possible, please try to explain the code using Dry Run because where the recursion comes it gets difficult to understand the flow. Also, do add the explanation topic (definition and example) and diagram in Notes. So that students whenever visit the notes, they would not need to go to video for explanation. Rest, All is Best..!!!

tree main root node ka level 0 nhi hota hai kaya ???

Didi if within post order there are doesn't present any null then what are the process

Thanks

airport ke paas video bana rahe ho?

Madam, kaash mai aapke haath me pakda hua pen hota😫

Didi aapne title pe kyu nhi likha ke ya java ka code pe hai main kitne focus ke sath dekh rha tha.
main tab se python se related tree data structure ke video dhund rha hu.
Mera complete 15 min waste ho gya..
Koi nhi at least fundamental to smjh aa he gya h
anyway thank you for this amazing tutorial
Or han main phir aaunga is video mein after learning java programming.
or gussa mat hona like kiye bina nhi jaunga.

Diameter of nodes are defined in terms of edges not nodes. So output should be 4 mam. I just checked leetcode.

thanks didi

Thanks for the lecture!! was able to solve the homework question.

The build tree function is wrong here as it's not building the binary tree but just going a left order tree always, it will never append to right edge as per the code. Please correct it. Also, you will need a queue in order to build a tree where leaves are filled in level order.

aapka jlwa hai didi

Aap Explain bahut acche se karti hai

Mam aap is lecture ka last wala code kaha run ki hai

How can we make objects for static classes?

Mam jb mai code likhte h to usko forward kaise kare share nhi hota h code whatsapp pr

Mam your teaching skill is fabulous... The way you teached us... It's really Appreciatable... Your hard works... Your skill... Your consistency.. Your taughts all are fabulous.. Really really big fan of yours..may God bless you shruddha mam....

Sum of Node not correct answer 😕 anyone has understand

Thank u for this video , really appreciate the effort. But can u please provide the visualization of what happens in the call stack when the recursive call happens in pre-order and other traversals happens.? I didnt really understand what exactly happens when return ; is executed

Didi apne level 4 ka depth 4 likha ha par hona toh 3 chahiye na please check if i am wrong or right.

we need DSA full course for 2nd year btech

what if your index is greater then your lastuseindex

Mam please add captions

Pls check Height of a Tree once again it should be maximum level+1