How pointer is benefit for design a data structure algorithm?

Answers were Sorted based on User's Feedback



How pointer is benefit for design a data structure algorithm?..

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

How pointer is benefit for design a data structure algorithm?..

Answer / deepu.

I am cheking.by useing
pointer we save the
memory.

Is This Answer Correct ?    2 Yes 0 No

Post New Answer

More C Interview Questions

what does ‘#include’ mean?

1 Answers   TCS,


what is a constant pointer in C

0 Answers  


Diff between for loop and while loop?

2 Answers   TCS,


How can you determine the maximum value that a numeric variable can hold?

0 Answers  


Explain how do you print an address?

0 Answers  






Differentiate between ordinary variable and pointer in c.

0 Answers  


any string of bits of length 'n' represents a unique non- negative integer between.............?

2 Answers  


How to throw some light on the b tree?

0 Answers  


In a header file whether functions are declared or defined?

0 Answers   TISL,


sqrt(x+sqrt(x+sqrt(x+sqrt(x))))=2; Find the value of x?

4 Answers   Subex,


Is void a keyword in c?

0 Answers  


int j =15,i; for (i=1; 1<5; ++i) {printf ("%d%d ",j,i); j = j-3; }

2 Answers  


Categories