Generalized linked lists are used because although the efficiency of polynomial operations using linked list is good but still, the disadvantage is that the linked list is unable to use multiple variable polynomial equation efficiently.
It helps us to represent multi-variable polynomial along with the list of elements.
generlised linked list contain structure or element with everyone containing it's own pointer .
it's generlised if list can have deletion ,insertion and similar insertion effectively into it.
typical sturucture of generlised lnk list in is as follow
typedef struct node
{
char c;
int index ;
struct node *next ,*down;
}GLL;
above is the basic structure of generlised linked list ,so by which we can create whole GLL.
It helps us to represent multi-variable polynomial along with the list of elements.
generlised linked list contain structure or element with everyone containing it's own pointer .
it's generlised if list can have deletion ,insertion and similar insertion effectively into it.
typical sturucture of generlised lnk list in is as follow
typedef struct node
{
char c;
int index ;
struct node *next ,*down;
}GLL;
above is the basic structure of generlised linked list ,so by which we can create whole GLL.
Good!
ReplyDeleteGood explanation!!
ReplyDeletethank you
Delete👍 nice
ReplyDeletethank you👍
ReplyDeleteWell started
ReplyDeleteGreat!!very informative
ReplyDeleteNice...
ReplyDeleteGreat work
ReplyDeleteInformative...keep writing
ReplyDeleteys we will write more informative blogs..
DeleteGreat work
ReplyDeletethanks a lot
DeleteGood started
ReplyDeletegood work haa!!
ReplyDeletewe are very happy , we get good comment s on our blog🙌
ReplyDeleteNice work. Very thoroughly explained.
ReplyDeletethanks
DeleteNice information...
ReplyDeleteThis content is very good keep writing !
ReplyDeletesure we write this type of blog
DeleteGreat work
ReplyDelete