How pointer is benefit for design a data structure algorithm?
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / deepu.
I am cheking.by useing
pointer we save the
memory.
| Is This Answer Correct ? | 2 Yes | 0 No |
What is the difference between calloc() and realloc()?
How can I write functions that take a variable number of arguments?
What is the output of below code? main() { static in a=5; printf("%3d",a--); if(a) main(); }
an algorithem for the implementation of circular doubly linked list
what is pointer?
13 Answers HCL, TCS,
pierrot's divisor program using c or c++ code
int main(){ float f=8.0; if(f==8.0) printf("good"); else printf("bad"); } what is the answere and explain it?
Efficient data structure for store/search list of 1000 records a)array b)double linked list c)circular queue d)hash table
#define MAX(x,y) (x) >(y)?(x):(y) main() { inti=10,j=5,k=0; k= MAX(i++,++j); printf("%d..%d..%d",i,j,k); }
what is the height of tree if leaf node is at level 3. please explain
Write a program to accept a character & display its corrosponding ASCII value & vice versa?
write a program to compare 2 numbers without using logical operators?