5.3 Binary Tree Implementation in C Program | Data Structures Tutorials
HTML-код
- Опубликовано: 6 ноя 2024
- Jennys Lectures DSA with Java Course Enrollment link: www.jennyslect...
In this lecture, I have implemented binary tree in C/C++. I have written a C program to create a binary tree of integers.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
**********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#jennyslectures
#datastructures
#binarytree
#ugcnet
#computerscience
Recently I attended a interview,mainly they asked about data structure which I learned here from scratch and particularly they asked about Binary search tree And its implementations and I was able to do it only because of you ...I have seen So much comments but never thought I would comment this ,I cant put into words how much grateful I am rn ,its mainly because of your lectures I got into the company .Thank You so Much.
Which company did you get?
Jutha hai sala
@@user-funny894-fun it doesn’t matter he is satisfied and happy 😃 that’s enough
😂😂😂
@@user-funny894-fun Once u get a job , U will stop commenting and replying on youtube.
I'm an engg student so I have viewed many tutorials and lectures but the amount of effort you put in making a video is just incredible,and the result is a very nicely explained and convincing lecture, really enjoyed the video.
Respect and love.
Yes for engineering syllabus this is perfect.
It's really a mind-blowing video for me when my mam taught me I was literally confused and totally collapsed after seeing this I can able to know clearly what is actually happening in every execution of lines of code you have written. The way you are teaching is really activating my mind and making me interested in studying codes further without lacking my interest mam. Thanks a lot for you.
3 years ago data structure was really tough for me...but for you mam now im doing good in data structure,,,thank you so much..... you channel is the most important for me in whole youtube..... thanks a tonne .....may god bless you and your family,,,,,
The teacher like you needed in our colleges you have a great and deep knowledge 👍👏👏
Ma'am you are such a blessing to the world...I've never been able to understand the tree's concept so clearly, until I watched your videos.
Your explanation of recursion calls is like watching a movie. After watching this today, I can say that I saw "recursion in action" for the first time. Until today, I just pretended that I knew recursion. Now I have a better idea of how it happens!
this series helped me alot im going to complete my data structure from here only, i have reached till here. mam you are just amazing, i have not found a teacher who explains so good like you any where. thanks to you that we got these lectures. thank you so much mam
if u need this program code in c then u can use it.
#include
#include
struct BstNode
{
int data;
struct BstNode* left;
struct BstNode* right;
};
struct BstNode* root=NULL;
struct BstNode* insert(struct BstNode* root,int x)
{
struct BstNode* temp=(struct BstNode*)malloc(sizeof(struct BstNode));
temp->data=x;
temp->left=temp->right=NULL;
if(root==NULL)
root=temp;
else if(root->data>=x)
root->left=insert(root->left,x);
else
root->right=insert(root->right,x);
return root;
}
int search(struct BstNode* root,int data)
{
if(root==NULL)
return 0;
else if(root->data == data) {
return 1;}
else if(root->data>=data)
return search(root->left,data);
else
return search(root->right,data);
}
int main()
{
root = insert(root, 15);
root = insert(root, 10);
root = insert(root, 20);
root = insert(root, 05);
root = insert(root, 30);
root = insert(root, 25);
while(1)
{
int n,l,k;
printf("press 1 for continue and press 2 for end ");
scanf("%d",&k);
if(k==1)
{
printf("enter the value for searching
");
scanf("%d",&n);
if(search(root,n)==1)
printf("found in
");
else
printf("not found in
");
}
else
break;
}
}
Mam you explain so much in detaill...you must write a book.
😂😂😂
He’s right 😊
no Matter what happens... ma'am keep teaching us....keep uploading ur videos... your teaching skills are awesome...
It takes an another life for my college professors to teach the concept of recursion in trees like you. Awesome explanation👏👏
I'm shocked to see the number of views on such good content.
Cause of the babe teaching it
@@joshuaduplaa9033 hey can't you give some respect to mam who is doing such a great job for free
@@varunrawat599 I'm just playing around lol I got alot from the video
@@joshuaduplaa9033 do you play around with your dad and mom too in a similar fashion. I highly doubt! have some respect dude, she taught us a lot.
@@kunalkumar2717 no, but i do with yours! :P it's the internet bro get over it
Man thankyou so much I have seen a lot of lectures but I cannot understand the exact point how we make binary tree and how is it but I see your lecture you clear all point in very easy and less time thankyou so much..
It was the most difficult topic. You explained it exquisitely!
Im stopping here cause my class is mostly focused in implementing , but I wanna thank you for putting all this knowledge for free on the internet and also praise your ability to teach , I must be in your channel for about an hour and it feels like 10 mins
good luck with what you do, you really helped :)
Ma'am, I really like the fact that you always explain some other topic as well, along with the main topic, and both very well. I opened this video to learn trees' coding for the 1st time, and on hearing recursion I was like :| :| :| ... but the way you explained was just fabulous! THANK YOU for your efforts and keep up the good work :)
I'm bca 1st year student and i was facing problem in binary tree when i watched you video it helped me a lot thank you so much mam
i've paid course of Abdul sir but I'm confused a little bit but now clear all of that thanks jenny's Lectures channel
Yeah I am confused too. I dont understand why he used to queue to implement binary tree instead of normally implementing it. I guess he didnt want to use recursion.
I also came here from same place because I didn't understand how to use double pointers.
i was trying to understand binary tree since last 3 days and today i watched this video and i realised how i wasted 72hrs when all can be done in a 25mins video, I love you maam
Jenny great . Clarity on explanation. Any one can easily understand data structures about your lecture. Thank you
well, i have to say...you have your own style of teaching and its just amazing
Great!! Such a complex concept explained at one shot without loosing the track. Hats off to your genuine efforts mam. It's a great help for me as a starter to understand trees concept. Thanks for your video.
All the words which come from your mouth are costly, your effect will not be wasted thank you so much
You have really cleared my concepts..Really appreciated madam.. hope to learn more from you.
I am an engineering student and can't understand how the recursion pattern works in tree.Your videos are very usful to me......thank you mam......Can u post some videos on java's class,interface,methods,attributes topics mam
Yes
This is seriously god level of Explanation in respect to recursion. I am not that kind of person who generally comment on videos but I can't resist myself to appreciate the effort. Thanks mam.
The way you explain recursion was marvellous, recursion which is itself a very scary topic,.
Very Well Explained, Highly Appreciate your Hard Work & In depth Knowledge.
However I think there is a *Memory Leak*, the termination of recursive call is -1. We are creating the new node and then checking the termination point, Which will create memory leak of twice the number of leaf nodes.
Man, you're such a great teacher, there hasn't been a single video from you which I haven't understood. Keep up the work!
Ma'am just a small suggestion, please use 'NULL' or the grounding symbol instead of writing 0 to avoid confusion between the integer 0 and the representation of the fact that a pointer is null
chalo engineering me the tab to aapki channel se mulakat nahi hui but abhi job preparation ke liye aap mil gaye, DHANYAVAD
Really ur video made me understand well without mugging coding... Thank you so much mam... Thank you so much...
Thanks for doing a lot of hard work for us......
you are a great teacher.
May God continue to shower you all his blessings and wishes.
Thanks a lot mam for uploading data structures videos...I can't understand a word in my college but after watching your lectures every concept becomes clear and easy. Once again thank you 🤗🙏
You are supremely skilled mam. Your teaching is beneficial for so many student . So many doughts get cleared while watching your tutorials.
Mam please make videos on recursion...as u r the only teacher whose content i can understand completely
Try mycodeschool he has a good video on recursion
In c playlist ... check it
after god you saved my life in my programming formtion thx
Mam Got the concept, but there is an issue in the code that if someone has to store -1 in the data then your condition will collapse. So I have created a conditional logic in your code that will help it run without any error.
#include
#include
struct node
{
int data;
struct node * left, *right;
};
struct node *create();
int main() {
struct node * root;
root = 0;
root = create();
return 0;
}
struct node *create()
{
int x;
char y ='y';
struct node * newnode;
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter the Value: ");
scanf ("%d", &x);
if (y=='n')
{
return 0;
}
else
{
newnode->data=x;}
printf ("Do You Want To Countinue(Press y or n):");
scanf(" %c", &y);
if (y != 'y' && y != 'n')
{
printf ("Wrong Choice
Enter Again (y or n Only): ");
scanf(" %c", &y);
}
else if (y =='n')
{
return 0;
}
else if (y =='y')
{
printf("Enter the Value of Left Child
");
newnode->left = create();
printf("Enter the Value of Right Child
");
newnode->right = create();
return newnode;
}
}
Thanks bro ♥️
This is the best explanation of this topic by far from my pov! Thank you!
yes
at that moment one enjoys a state of joy when he understands the tough concept easily...i'm thankful for such an moment mam....your lectures are very great...
mam you are adding so many adds to your vedios
The best teacher one could ever have ❤️
Huge love and respect to you ma'am 🙏
Goddess of Data Structures
Thank you Jenny. A slight improvement:
tNode *createBinNodes(int data)
{
int x;
tNode* newNode;
if(data==-1)
return NULL;
newNode = new tNode{NULL, data, NULL};
cout
thanx bro
Easiest explanation and implementation of every concept , I understood in first attempt 😀
Thankyou mam for teaching us in such an easy manner
Ma'am its a request. I really love all your C videos. It's really helpful for my college studies for sure. So I am looking forward for you to make Python videos when you are ready and I think it would be really helpful for students for placement studies.
Belive me i was stuck in recursion topic you cleared it very easily you're gem jenny
@shweta sukhdeve Yeah sure see As There is A Condtion If (x==-1) { return 0 or say null } When Function Returns A Value Zero Or Anything lets say 5 .
It Means The Work Assigned To That Function Is Over Now .And The Memory Allocated To That Function Is Removed .
Basically The Work Of A Function Is Take Some Value Process It Give A Other Value And Just The Function Works Is Over . Just Like Sin30 Sin Function Take A Value Lets Say 30 And Then Give A Output 1/2 and Sin Function Is Over Now . The Function will Be Closed And The Value Is Returned To Previous Function from where it is called and Then This Process Continues
See You Can Learn Data Structue Only When You Can Visualize Data Structure Take A Copy and Pen And Start Making Diagrams.
DS Algo Takes Time Don't worry If You Are Not Understanding
Me Also Understood Recursion Topic Finally By Visualizing By Self ..
Happy Coding !
@shweta sukhdeve Aree.. See She Printed On The Screen "Put Data Or Enter -1 for No Node" NO Node Means If you don't wanna add any other node on that side. SO if user entered -1 then it simply means no node is needed on that side of the tree . So This How X will be -1 and Function will be closed. Now Function end loop will be shifted to the right node.
Hope It Helps !
@shweta sukhdeve yeah That Can Be a Problem But It Can Be Resolved By Using Two Inputs I Solved It By Making A Char Variable Then I Asked For user Do You Want To Insert Y/N and Made A Condition
If(var=='N') return NULL;
So It Can Be Solved By This Way ..
@@oyepuru can u explain why she didin't put any condition to the right side ?
your video really help me a lot and I got A+ on my course Thank you very much~~
It's been so easy to learn the concepts from you Ma'am.
Best video on the internet. I loved the way you explained the recursion concept. Thank you very much mam.
You have very Highly talented skill to explore data structures from basic
you are literally amazing, this is all myth on ain't memes that you are famous only for your beauty... you are a great teacher too. Thanks for the amazing series on the data structure.
Awesome, i like your teaching style, and i want to learn through this style mean using system memory, may allah bless you happy and more life with success in both the stages of life
U explained everything without any queries
your lectures come with great detailing of the topic mam. and the way you explain it so calmly is a treat to sit till the last second. Thank you for your effort mam.
Mam at first i thought the views are on your views but you teach at least 1trillion times better than my teacher
Can some one please talk about her dresses!!? They are all so beautiful and cute❤💛
Each lecture it gets prettier than the previous one ;)
These lectures are gold
Beautifully explained the concept of recursion...Mam you clear all my doubts and confusion in that difficult concept...
Very very thankful I'm your's...
I'm going to appear in nagarro interview and i feel very much confident after watching this series once again 💞
Thank you so much mam
mam your teaching method is so easy to understand and detail as well
thanku mam
U Are a Gem Mam....respect to you..Cleared my concept❤
Thanks Sagar
@@JennyslecturesCSIT I have question...are these lectures are enough to solve the DS questions specially in GATE?...or something i should read beyond this..
Ma'am you are God for students 🥺
really superb explanation you are the best teacher i have ever seen
but i dont know why the likes are less
best video plz donot dislike this video
generally i dont comment but after watching the video i want to share this with you mam
thank you mam
you are really awesome
After a long period mam m glad to c u ... happy Dussehra mam & Indian Air force day as well
thank you so much mam . I'm realy realy happy because of this channel , you give me a lot of knowledge
You are helping a lot of people getting quality core knowledge.
One question from my side, should we expect the videos about the Heap Data Structure ?
Or if it is already there, then somebody please be generous and guide me to it.
Thanks
Mesmerizing explanation ma'am of the topic
you explained it very well mam.., specially the recurssion portion
Zabardast Explanation maam....... I'm preparing my Data Structures from your channel only
simple and classic lecture!!!
Here the full code is
#include
#include
struct node
{
int data;
struct node*left;
struct node*right;
};
struct node* create()
{
struct node*newNode = (struct node*)malloc(sizeof (struct node));
int x;
printf("
Enter Data (-1 of no node)");
scanf("%d",&x);
if (x == -1)
{
free(newNode);
return NULL;
}
newNode->data = x;
newNode->left = NULL;
newNode->right = NULL;
printf("Enter left child of %d",x);
newNode->left = create();
printf("Enter right child of %d",x);
newNode->right = create();
return newNode;
}
void inOrder(struct node*root){ //In order traversal
if (root == NULL)
{
return;
}
inOrder(root->left);
printf("%d ",root->data);
inOrder(root->right);
return;
}
void preOrder(struct node*root){ // Pre order traversal
if (root == NULL)
{
return;
}
printf("%d ",root->data);
preOrder(root->left);
preOrder(root->right);
return;
}
void postOrder(struct node*root){ // Post order traversal
if (root == NULL)
{
return;
}
postOrder(root->left);
postOrder(root->right);
printf("%d ",root->data);
return;
}
int main(){
struct node*root;
root = NULL;
printf("Creating binary tree:
");
root = create();
printf("
Pre Order traversal ");
inOrder(root);
printf("
In Order traversal ");
preOrder(root);
printf("
Post Order traversal ");
postOrder(root);
// freeTree(root);
return 0;
}
Finally some inner peace✌🏻 thank you maam for such a good explanation
Great explanation mam. I liked the way you explained the recursion in the code. Your explanation is easy to understand. Keep on making this type of quality content. Lots of respect🙏🙏
Instead of writing the code on board You should try to write it on IDE anyway great lecture on the topic👏👏
no white-board / paper is always fine instead of IDE because actually concepts are easily understandable only when you use paper or white-board , once you got the concept write the code on any platform... KEEP IT UP MAM
Really appreciating work Mam! Thanks a lot for providing such a precious lecture.
Congrats to advance wish for 1M mam...✊
I was looking for brief implementation of Trees concept and here it is!
So beautiful explained!
Thank you, Jenny!! :)
I could watch your content all day long, such a nice content
thnak you sister for clearing the doubts!!
perfect lectures for anyone new to these concepts - covers everything - thank you so much
,you works very nice.you continue this lecturing and i also continue ours admire to you ......thank you.....
Well explained..... Thank you mam
Amazing ma'am
You are such a good teacher
Love you❤❤❤
This video is simply gold. What an explanation!
Mam the second left node to the root contains the address 300 where as the right child to the root also contains the same address 300 I think one of the address has to be changed and thanks for posting such awesome content ❤️
Ma'am aapki explaination 👍🏻👍🏻...
Very nice tutorial maim..
I think This is the best binary tree tutorial in RUclips.
Salute to ur hardwork.
Can u share , from which resources you have learned c language and data structure. I want to learn in deeply like you
madam you too much. the explanation was smooth. thank you very much ma'am
Hi Jenny, Could you upload a video on recursion and its working? I and many people like me often get confused about the working of recursion. It would be very helpful if you are able to upload a video on the working of recursion with example.
Very much thank you ma'am. You are really an angel😍😍😍
Ma'am, I must commend your effort to instill knowledge worth more than a mountain of gold in people, but could you please upload a video on how to display the elements of a tree, or is it the same syntax as in the previous videos on Arrays and Linked list?
wow amazing concept mam all get clear in mind and u r brain is like Einstein mam
hatt
i love your.........lectures
alham dul illah
-saksham
Thanks a lot mam.
You have done a great efforts to explain the topics in a very easy way.
sabh kuch achaa hey exam kuu time nahee hey app kaa videos dekneykey leye
Great Explanation but the only thing I want to know that if I want to enter -1 as a data then I think the program will fail what to do for such case
Very helpful video in very easy way. Thank you ma'am
Thanks a lot for this video, it cleared many things. A teacher like you is needed in colleges. Anyways thanks again!