this mam is like a gem, i just wish that the sir who taught us previously would never come again literally most of his videos have been either not understood or skipped :|
awsome lecture ....don't mind it was a very good lecture....just explaining the recursive calls would have been alot better...also please provide the notes for this lecture.
this mam is like a gem, i just wish that the sir who taught us previously would never come again literally most of his videos have been either not understood or skipped :|
maam one question arises, that why we comment previous function(preorder) when we compile next function(inorder)? why we don't compile all function at the same time?
Ma'am, What is the need for writing struct before creating Instances of any struct or writing parameter for function? Because I am not getting an error even after removing the keyword "struct". Can you please elaborate on this?
It is a C convention that we add struct keyword even in function but now that i am asumming u are coding in cpp u can avoid it and hence u are not getting any error
I thought that in a binary tree, the left child of each node should always be less than the value of the node. In the example you have shown that 4 is the left child of 3. similarly you have shown that 6 is the left child of 3. I understand that for explanation purposes you may have done this, but I was watching another video where you explained that the left child of each node is always less than the value of the node and for viewers watching your video and learning for the first time, this will confuse them.
hello sir ... I am using vscode...and as per my college project I have to use graphics.h file or any other graphical file....but I am not able to do that...can you make a video on this topic as early as possible plzzzz.... it's my humble request. if you read this plz reply or give any hint, so I will wait
@@prathameshmalode5524 search for c++ gui which supports existing version of c++ which you are using. If u want to use graphic.h then u have to use turbo c++ instead of vscode
may be I am late but still u can use code blocks and use libraries like sfml and opengl to deal with graphics link for setup th-cam.com/video/fcZFaiGFIMA/w-d-xo.html
In the pre order traversal function, the function should terminate after printing 4,since preorder((4->left)==NULL),it have no left child, so root will be NULL. please clarify
If you still havent got the answer for this, let me help you, in the class you have created instead of int data; type string data; or double data; whichever you like. Pls reply here, if you found this helpul.... If you have any other doubt be sure toe tag it here.
Jis jis video mein in Ma'am ne padhaya hai wo sabse jyada achse samajh mein aayi hai!! Best!!
Agree!!
Yeah
Sahi me
Because Ma'am is an Engineer.
Yes aur vo dusri mam ka bhi acha rehta hai
It was my finals paper today and I watched your lectures only, a day before exams and I did so well.
Thank you soo much you guys are truly the best ❤️
code
#include
using namespace std;
class node{
public:
int data;
node*left;
node *right;
node(int val){
data =val;
left=NULL;
right=NULL;
}
};
void preorder(node* root){
if(root==NULL){return;}
coutleft);
preorder(root->right);
}
void inorder(node* root){
if(root == NULL){return;}
inorder(root->left);
coutright);
}
void postorder(node* root){
if (root==NULL){
return;
}
postorder(root->left);
postorder(root->right);
coutleft=new node(2);
root->right=new node(3);
root->left->left=new node(4);
root->left->right=new node(5);
root->right->left=new node(6);
root->right->right=new node(7);
postorder(root);
return 0;
}
this mam is like a gem, i just wish that the sir who taught us previously would never come again
literally most of his videos have been either not understood or skipped :|
Thankyou very much, i have no words to say a big thanks to you all , jo mujhe college ke professors nahi sikha paye aapne 15 min me sikha diya
Yh toh bht easy hai, me dar se iss topic ko nhi padh rha tha 🥹. Thank you Di & Bhaiya 🙏
great work everyone in the team kudos!!
The explanation was excellent, any one can get from it.
Thank you so much, your making a difference.
In depth explanation is more needed otherwise good course 😇
awsome lecture ....don't mind it was a very good lecture....just explaining the recursive calls would have been alot better...also please provide the notes for this lecture.
You made it very easy for us!!!!
Thank you shraddha didi...❤
this mam is like a gem, i just wish that the sir who taught us previously would never come again
literally most of his videos have been either not understood or skipped :|
Amazing teaching skill
Whhahhh, maja aa gaya...bs aisehi simple simple explain krte jayiye
the best explanation, thanks guys
Waah didi mauj kar di, best explanation ever,
Thank You 😀
Hello..I want to know that does this playlist contains complete c++ and DSA ?
@@mdekramuddin8534 yes
Such a nice explination. Thank you so much :)
thanks saraddha di di
Amazing🙌
Do it's iterative version. Recursive version is easy to understand for all but iterative is difficult. Make a video on that.
I was not able too understand the tracing of recursion here can you please help me out
@@nishantdalvi9470 build a call stack and do dry run for given tree you will understand. :)
@@sourabhchoudhary7289 Ya bro actually now i am going that way for the problems from the start I am doing it for tower of hanoi now
@@nishantdalvi9470 building callstack for recursive problem is good
@@sourabhchoudhary7289 this is very irrelevant comment but ur body's amazing lol
Awesome video Aman and Shilpa.
Good job shardha ma'am
Thanks
Thanks a ton didi
Thanku soo much sirji Didi ji 🙏
Greatly explained,but the code doesn't print out the traversals mam.
Souce Code:
#include
using namespace std;
struct node
{
int data;
node *left;
node *right;
node(int value)
{
data = value;
right = NULL;
left = NULL;
}
};
void preorder(struct node *root)
{
if (root == NULL)
{
return;
}
cout data left);
preorder(root->right);
}
void inorder_traversal(struct node * root)
{
if (root == NULL)
{
return;
}
inorder_traversal(root->left);
cout data right);
}
void postorder_traversal(struct node * root)
{
if (root == NULL)
{
return;
}
postorder_traversal(root->left);
postorder_traversal(root->right);
cout data left = new node(2);
root->left->left = new node(4);
root->left->right = new node(7);
root->right = new node(3);
root->right->right = new node(5);
root->right->left = new node(6);
preorder(root);
cout
bahot badhiya
for me it is the best video om binary tree ,thank you Apna College
Completed
Great ma'am
It is my final lab exam (27august2023). Hpope i can do better . pray for me.
thanks a lot
maam one question arises, that why we comment previous function(preorder) when we compile next function(inorder)? why we don't compile all function at the same time?
Live📍
Thanks mam, made easy to learn
Nicely explained!
Notes of this lecture is also unavailable? :)
Which extinction is used for output?
superbb explanation
Ma'am agar tree bahut bada ho to kaise traverse code likhenge
Bhai inke notes kab aayenge
Ma'am, What is the need for writing struct before creating Instances of any struct or writing parameter for function? Because I am not getting an error even after removing the keyword "struct". Can you please elaborate on this?
Same doubt
It is a C convention that we add struct keyword even in function but now that i am asumming u are coding in cpp u can avoid it and hence u are not getting any error
aisa lagta hai khud revision kar rahi hai
Pls give some one tree topic notes
Mam where is the notes of this lecture
please reply Thanks🥰
Thank you D
Which extension is used for Testcase ?
I thought that in a binary tree, the left child of each node should always be less than the value of the node. In the example you have shown that 4 is the left child of 3. similarly you have shown that 6 is the left child of 3. I understand that for explanation purposes you may have done this, but I was watching another video where you explained that the left child of each node is always less than the value of the node and for viewers watching your video and learning for the first time, this will confuse them.
Binary tree amd binary search tree are different
what happen when we do not put base condition in this particular question?
jo doubt aa rha hai wo implement karo , uh will understand
Recursive functions cannot run without a base condition. The loop needs to end at some point naa? It will simply not run your function.
7:43
Is it shradda didi taking this video?
please make a tree from createTree function to avoid writing of root->right->left=new Node(6);
Right
Mam , where are the notes?
Km se km code Ko dry run krke to btati didi ....seedha recursive call kr diya ..
Kuch mehnat khud bhi karo bro
What about notes????
ab kisi bhi lecture ke description mein notes kyu nhi daale hue
Where are the notes
which extension is this(that display when u run the code)
Competitive Programming Helper (cph)
Link for notes is not available
ek graphic design (photoshop,illustrator,pagemaker etc.) ka course bana do please sir..
class use kar sakte the kya?
Yes we can Use class for implement these methods
💝💖
hello sir ... I am using vscode...and as per my college project I have to use graphics.h file or any other graphical file....but I am not able to do that...can you make a video on this topic as early as possible plzzzz.... it's my humble request. if you read this plz reply or give any hint, so I will wait
Hello bro may i if i could
graphic.h is outdated
@@zainulkhan8381 then what should i do now...
@@prathameshmalode5524 search for c++ gui which supports existing version of c++ which you are using. If u want to use graphic.h then u have to use turbo c++ instead of vscode
may be I am late but still u can use code blocks and use libraries like sfml and opengl to deal with graphics
link for setup
th-cam.com/video/fcZFaiGFIMA/w-d-xo.html
🙏🙏🙏
Hello Mamta sweetheart!
🤳🤳🤳🎭
In the pre order traversal function, the function should terminate after printing 4,since preorder((4->left)==NULL),it have no left child, so root will be NULL.
please clarify
she uses base case
if(root == NULL){
return;
}
watch this part of video 12:16 it helps you..
11:13 built structure hai node ka,,kya mtlb?? This course is not for beginner!!!̣..😢😢😢😢😢
Kyuki voh iske pahele wali video mein samjaya hai👀
Jo code ap batati ho wo please description box me code de diya karo
Can anyone guide me how to find this testcase runner
Can any one tell me the difference between nrl and lrn traversal
Already done in +2 isc 😎
notes ??
@Anyone , What changes would I've to do to get out in A, B,C instead of 1,2,3. i mean how to convert it from int to string output
If you still havent got the answer for this, let me help you, in the class you have created instead of int data; type string data; or double data; whichever you like. Pls reply here, if you found this helpul.... If you have any other doubt be sure toe tag it here.
code all to all yahn pr share kr dyaa kare plz
12:47 When you see recursion in video in Binary tree lecture
13:05 again
❤️🙏👍
Can someone please tell me at 12:30 which extension is she using to run the test cases?
competitve programming by agrwal karke kuch hai
please have dry run in the videos, started watching understand the theory ,but when try to understand comparing to example stuck
🙂
notes
Ma'am maine class se banaya to output nahi show kar raha
Make everything public in class. If that's not the problem then can you share your code here.
why cant we use public class instead of struct....?
we can use class also...
Bro how did u crack placements can u tell
❤️🔥🔥🙏👍🤟
Class 12 course upgrade kar do 2021-2022
th-cam.com/video/c7RsZDvqIXo/w-d-xo.html
Sr ji HTML NAME
HTML NMBR का किया उपयोगी है Programming में🙏🙏🙏🙏🙏🙏
Mam actually mera 12673 aaraha ahi
What I have to do??
Error Error Error !!! Somebody help
BinaryTree2.cpp:40:6: error: redefinition of 'void preorder(Node*)'
40 | void preorder(struct Node* root){
| ^~~~~~~~
BinaryTree2.cpp:20:6: note: 'void preorder(Node*)' previously defined here
20 | void preorder(struct Node* root)
you have defined two functions with the same name check line number 40 & 20
Ma panner khaunga
Tera baap khilayga
@@jiosim1377 nai bhai🥲
Amazing 🔥🔥🔥
Great explanation 😊🎉.
ek graphic design (photoshop,illustrator,pagemaker etc.) ka course bana do please sir..
ek graphic design (photoshop,illustrator,pagemaker etc.) ka course bana do please sir..