How pointer is benefit for design a data structure algorithm?
Answer Posted / kaushal vinayak
Pointer is that variable who store the address of the
variable.In data structure a node consist of two part data
and link part,where link part consist of hold the address of
the next node which is possible through pointer which
points to next node. through pointer you can go to the next
node in any defined data structure.
| Is This Answer Correct ? | 10 Yes | 0 No |
Post New Answer View All Answers
What are the two forms of #include directive?
Why should I prototype a function?
What are pointers in C? Give an example where to illustrate their significance.
What is #define size in c?
what is the difference between class and unio?
How to compare array with pointer in c?
What is dangling pointer in c?
What does c mean in standard form?
Is malloc memset faster than calloc?
Explain how can type-insensitive macros be created?
Explain what are the standard predefined macros?
What does c mean?
What is the argument of a function in c?
FILE *fp1,*fp2; fp1=fopen("one","w") fp2=fopen("one","w") fputc('A',fp1) fputc('B',fp2) fclose(fp1) fclose(fp2)} a.error b. c. d.
Explain what are preprocessor directives?