Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.5

[@sleepypanda7172]

Thank-You :) you guys are great! Sharddha didi's Explanation is just awesome! Thanks again

[@abhijeetkumarjha8137]

I had no confidence in coding when I had begun this course and also hated coding , it was like a burden to me. But now after almost a month I have reached a level where I only want to code . All thanks to this amazing playlist by Apna College channel.

[@rahuldasari1886]

+1

[@neerajkumarsingh4721]

The Hardest part is yet to Come :)

[@shivangbhardwaj3165]

bro yo ufinished 97 videos in a month? how do you keep the consistency please help

[@harshhcode]

@@shivangbhardwaj3165 same question !!!

[@dehlanshandirkayr6182]

@@shivangbhardwaj3165 3 videos a day :)

[@vikasmane8851]

i appreciate all hardwork of apna college Team Huge respect to you guys

[@rahultripathi591]

bro do you know where can I have notes of lectures that are not in the description.

[@melodytunes2204]

@@rahultripathi591 bro agar pta chale toh mujhe bhi btadiyo

[@arky1923]

This is a quite optimized and straightforward approach if anyone needs it void Level_order(node* root){ if(root==NULL){ return; } queue q; q.push(root); while(!q.empty()){ node* temp = q.front(); cout data left)q.push(temp->left); if(temp->right)q.push(temp->right); } } // call by Level_order(struct node* root);

[@vivek_1300]

wonderfull explanation didi

[@shubhamkumar9313]

Awesome, I have been watching lot of other YT videos, not able to understand. But this pictorial presentation is really helpful.

[@SaurabhKumar-tm4er]

Nice way to understand all of us didi thanks

[@girishporwal5183]

Didi u are the best. Ty Team AC

[@vidhanpatni8338]

2:25 you can hear the cooker whistling here lol;

[@dhruvsakariya3129]

Thank You this is very intuitive approach

[@amanrathore3610]

Very nice exxplaination and video editing,tqs shradha di

[@sanyazaveri4511]

Very nicely explained. Thank you!

[@BECRIZWANkhan]

Great work by apna college

[@dhruvarora8136]

best explanation ever. thanks to those animations

[@anishsingh9043]

If someone is confused. Most basic approach. You just optimize as you want. Just to explain what she did in an elaborated way. while(!q.empty()){ while(q.front() != NULL){ Node* node = q.front(); coutleft); } if(node->right){ q.push(node->right); } q.pop(); } q.pop(); if(!q.empty()){ q.push(NULL); level++; } } cout

[@chinnu9772]

Concept and explanation into deep, tq!!

[@Kaushik846]

Superlike very nice explanation

[@yashchampaneri1972]

Pls provide Notes of all lecture which is not provided till yet!

[@RajanGupta-fj8fi]

Didi you are great

[@murapovyerkhan2439]

Thanks brothers

[@harsh.8436]

It was a great class!!!! Can we access notes of this lecture?

[@santoshbhupati3579]

thank you so much

[@MindMunchies.]

thank u dii

[@shikhamaurya4453]

All I can do is not skipping the Ads and say "Dhanyawaad" to apna college team.😊

[@anirudhrajebhosle4286]

Aman bhaiya nai apna channel monetize nahi kiya hai. Ad dekho yha na dekho usse Aman bhaiya ko koi farak nahi padega.

[@RAMANKUMARGCEBIT]

very helpful

[@sudipc9880]

Thanks

[@raaz7841]

if we need sum of kth level only then why we traversing to the last node , we can traverse only up to kth level then break out, there is chance of improvement in this code, please look into this.

[@768_sakshisharma9]

please make more videos as such

[@HimanshuSingh-zu4ht]

better solution for sum at kth level (just for different approach) void sum(node* root,int k,int* ans){ if(root == NULL){ return; } if(k == 1){ *ans += root->data; } sum(root->left,k-1,ans); sum(root->right,k-1,ans); } int main(){ node* root = new node(1); root->left = new node(2); root->right = new node(3); root->left->right = new node(5); root->left->left = new node(4); root->right->right = new node(7); root->right->left = new node(6); int ans = 0; sum(root,1,&ans); cout

[@abhishek.rathore]

Can't say its better as recursive solutions are generally slower than iterative ones.

[@aryanagarwal2071]

@@abhishek.rathore BFS vs DFS u cant say which one is better

[@chickmagnet2067]

@Himanshu Singh agreed.

[@pk4288]

there will be k+1 in one of the sum(....)

[@PradeepSingh-tq7kg]

listen vro k==1 vaali loop me return laga de acha rahega varna k negative hota jaayega until last level jo kisi kaam ka nahi hai................

[@hassankhan2698]

Use an optimised approach no need to insert null at the beginning not the the end of while loop. Simple use while loop until the queue is empty.

[@aishiksarkar8226]

class Solution { public: vector levelOrder(TreeNode* root) { vectorv(0); vector v1; if(root==NULL) return v1; queueq; q.push(root); q.push(NULL); while(!q.empty()) { if(q.front()!=NULL) { // coutleft); if(q.front()->right!=NULL) q.push(q.front()->right); q.pop(); } else { v1.push_back(v); v.clear(); q.pop(); if(q.empty()) return v1; else q.push(NULL); } } return v1; } }; LeetCode Solution

[@sasuke3737]

push karrenge peeche se

[@siddharthlokesh9896]

What is the significance of int 32_t main(), Someone pls explain

[@PradeepSingh-tq7kg]

@@mr.darkheart2979 yes

[@PradeepSingh-tq7kg]

simple int can be 16 or 32 bit which depends on compiler to compiler but int32_t is always of 32 bits and there is one more type int_fast32_t this serves as the name hints

[@niazi74]

Notes of Level order traversal????

[@saurabhshandilay8261]

Bhai moj kar di

[@alveenamasub8499]

Million dollar content

[@raaz7841]

notes link?

[@MaheshPatil-of1zy]

Why this problem cant solved using recursion?

[@ogbuddha7835]

Queue declare krne pe error aa rha h

[@pradeepasktkar4330]

😊😊

[@vaibhavsharma4500]

Thank you 🙏🙏

[@ayush_b_59]

Can anyone tell me "apna college" channel is giving course of full stack developer? Please

[@sleepypanda7172]

try to ask on his mail. & ya be formal and nice to get a quick reply. CHEERS

[@tanmaiysethiajain4367]

gfg with animation

[@gauravkulkarni6925]

Does anyone know Why are we writing queue Q; What does Node* mean and whats the difference in queue *q …..in short I want to ask * bracket ke Andar Q ha ?.?

[@AakashYadav-ri1pt]

in queue Q , node* is the data type of queue

[@tiger20studio80]

😀

[@sachinbairi6353]

void levelOrder(Node* root){ queue q; q.push(root); while (!q.empty()) { Node* curr = q.front(); q.pop(); coutright) q.push(curr->right); } }

[@gauravkulkarni6925]

Why are we writing queue Q; What does Node* mean and whats the difference in queue *q …..in short I want to ask * bracket ke Andar Q ha ?.?

[@sachinbairi6353]

@@gauravkulkarni6925 bro humko ek queue chahiye to store the pointer to our tree Nodes thats why we are doing queue q and not queue *q

[@palashpadiya2792]

My queue is not working

[@loser0023]

@@gauravkulkarni6925 bhai basically queue is a container hence we need to specify what are we storing i to , for example say , maybe int or string , here we have defined our own structure node* , which species its clas , hence we specify it using queue same as we do in the case of queue

[@shadowmonarch3155]

can you tell why we use Node*curr=q.front();

[@SubhamKumar-fr7gw]

har video me poora bhar bhar ke paikhana kar deta hai

[@RohitSingh-se6ch]

guys lne 26 q.pop() kyu kiya

[@pushprajsinghjadoun2229]

kyu ke jo value print kar de hai vo value queue se hatane padhe ge

[@nitishsingh3470]

Amazing

[@harpic949]

Ma panner khaunga

[@palashagrawal2343]

y used NULL concept at first to make it more complicated? We can just simply avoid that NULL to traverse

[@revanth6476]

to just make you understand different problems on traversal. it will help you @palash Agrawal

[@thunderstrm4028]

it will help you in to find the left view and right view of the binary tree

[@darshanpagar1894]

can you please give code for sum at kth level without using null

[@ronakgarg7569]

Didi aapne dimaag khol diaa

[@Pragma_Solidity]

why are we using NULL in order traversal? i mean code runs same without pushing NULL

[@gauravupreti9340]

Yeah, no need for NULL in this, they did it so that if you want to print binary tree line by line, then you can use NULL to do that.

[@PradeepSingh-tq7kg]

if u want to keep track which level u reached

[@Funprince1411]

Good evening mam..

[@srizwan789]

abhi thak mam ne reply nahi diya apko....🙂🙂

[@adityanarayanjaiswal890]

26000

[@stylishstarrohan9616]

mujhe 1 ande vala burger

[@saurabhshandilay8261]

Koi notes bhi upload kr do😭

[@rutvikrana512]

In Level Order Traversal, If We Dont want to know nodes with level than simple use queue without using NULL at all. void levelOrder(Node* root){ queue Q; Q.push( root ); while( !Q.empty() ){ std::cout data left ) Q.push( Q.front() -> left ); if( Q.front() -> right ) Q.push( Q.front() -> right ); Q.pop(); } } In Second Question We Can Simply Do Recursive InOrder Traversal with Height ... void inOrder(Node* root, int height, int& K, int& answer){ if(height > K) return; if(root -> left) inOrder( root->left, height+1, K, answer ); if(height == K) answer+=root->data; if(root -> right) inOrder( root->right, height+1, K, answer); } int sumAtK(Node* root, int K){ int answer = 0; inOrder( root, 0, K, answer); return answer; }

[@epic_amvs4095]

Yes but then you will not be able to check the different levels

[@gauravkulkarni6925]

Why are we writing queue Q; What does Node* mean and whats the difference in queue *q …..in short I want to ask * bracket ke Andar Q ha ?.?

[@epic_amvs4095]

@@gauravkulkarni6925 * bracket ke andar isliye hai kyuki node pointer pass kar rahe hai template mai jaise int x likha hai to agr hame queue chaiye x ko store karne ke liye to ham banaynge queue usi prakar se node * x ko queue mai store karne ke liye banaynge queue kyuki template[ bracket ke andar jo likha hai usme ] mai hame data type pass karna hota hai aur x ka data type is case mai node * hai.

[@AyushKumar-pe9wx]

The quene q; is not decalred showing while I am trying to run the code help me out please! @ApnaCollege

[@abhijeetsawale9944]

Include queue library in code #include