Double Linked List in Data Structures and Algorithms | Part-1

Double Linked List in Data Structures and Algorithms | Part-1

💡 Also Watch

Subscribe to our channel and hit the bell 🔔🔔🔔 icon to get video updates.

💡 Visit Our Websites

#DataStructures #Training #Course #Tutorials
--------------------------

💡 About NareshIT:

"Naresh IT is having 14+ years of experience in software training industry and the best Software Training Institute for online training, classroom training, weekend training, corporate training of Hadoop, Salesforce, AWS, DevOps, Spark, Data Science, Python, Tableau, RPA , Java, C#.NET, ASP.NET, Oracle, Testing Tools, Silver light, Linq, SQL Server, Selenium, Android, iPhone, C Language, C++, PHP and Digital Marketing in USA, Hyderabad, Chennai and Vijayawada, Bangalore India which provides online training across all the locations

--------------------------

💡 Our Online Training Features:
🎈 Training with Real-Time Experts
🎈 Industry Specific Scenario’s
🎈 Flexible Timings
🎈 Soft Copy of Material
🎈 Share Videos of each and every session.

--------------------------

💡 Please write back to us at

[aashcharyakatoch]

I've been struggling for 2 years to understand these concepts. Finally, I do, all thanks to you sir .. :)

[rajpurohitn]

The way expalination is 🔥 very next level nothing easier way than this to understand the concept all fails in front of srinivas sir. Thank u sir.. Watching AFTER 5 TO 6 YEARS ...

[somveerkhaunkar]

One of the best teachings I have ever seen in my life .Thank u sir
And keep it up👍👍

[abhaypratapchaudhary]

ser may god always bless you and make upcomming life happy . realy helpfull. clear all the concept.

[ahmedosman]

Feels like the cobwebs are being cleared from my brain. It's all starting to click. Thank you!

[malakarakeshkumarreddy]

You are one of the best lecturers i have seen, amazing talent sir

[googlegoodies]

After 6 years I am still able to understand the logic great video sir love you please do make more video sir we love your Srinivas sir 😍😍😍

[MCM_Harish]

I am a program lover sir and i like to find new things which i want lo learn new programs day by day but this topic is so helpful after you thought me
Thank you sir

[codeBecomeEays]

One of the best teaching skills you have sir.❤❤

[sachinkumar-jhcs]

U r the best teacher sir, thanks a lot for teaching us in this way!!!😇🤘

[ahmadsyed]

i was thinking ds was tough but now its look too easy like mathematics, the tone, the skill u have is unmatchable .THANKS @youtube and sir

[arpitaingermany]

The most easiest way of explanation. Thank you sir

[ritikajoshi]

Sir u really have made the concept of linked list very easy to understand, i m learning this concept for frst time and i had seen many videos for the same topic on other youtube channels but i found your video the best
thnkuu sir

[eilay-fxhe]

i understood everything sir
you are genius

[azmedia]

Easy to understand sir god bless you sir all the 👍💯

[un_facedstudios]

And finally I got solutions for my dsa classes thanku so much sir

[indiangamermohit]

Sir please upload more videos on data structure topics like
1)deque and it's types
2) priority queue and types
3) circular linked list
4) graphs
5) All searching technique
6)All sorting technique
Please sir your explanation clear all the concepts
Thank-you for these amazing videos

[goyaldeekshant]

HERE IS THE COMPLETE CODE:
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node * left;
struct node * right;
};
struct node* root=NULL;

void append() //Adding new node at the end//
{
struct node* temp;
temp=(struct node*)malloc(sizeof(struct node));
printf("Enter new node data: ");
scanf("%d", &temp->data);
temp->left=NULL;
temp->right=NULL;

if(root==NULL)
root=temp;
else
{
struct node* p=root;
while(p->right!=NULL)
{
p=p->right;
}
p->right=temp;
temp->left=p;
}
}

void display()
{
struct node * temp=root;
if(root==NULL)
printf("List is empty\n");
else
{
printf("elements are: ");
while(temp!=NULL)
{
printf("%d ", temp->data);
temp=temp->right;
}
}
}


void length()
{
struct node* temp=root;
int count=0;
if(root==NULL)
printf("list is empty\n");
else
{
while(temp!=NULL)
{
count++;
temp=temp->right;
}
printf("length is: %d\n", count);
}
}

void main()
{
int ch;
while(1)
{
printf("Available choices are: \n");
printf("1.Append\n");
printf("2.Display\n");
printf("3.Length\n");

printf("Enter your choice:");
scanf("%d", &ch);
switch(ch)
{
case 1: append();
break;
case 2: display();
break;
case 3: length();
break;
case 4: exit(0);
default: printf("Invalid choice\n");
}
printf("\n");
}
}

[pranaychavan]

sir your teaching skill is another level.

[umeshlangade]

nicely explained ....
thank you very much srini sir