title: creating a queue of pointers in c
body: <p>i have a dynamic number of pointers all having the same size. i need to store all the addresses of my pointers in some place like a link List in order to fetch them later on.<br>
  my question is what structs should i use. is the following correct:</p>
  
  <pre><code>struct Node{
      int *k;
  Node*Next;
  }
  
  struct LS{
      Node*first,*last;
      void push(Node*n);
      Node* GetFirst();
      Node* GetLast();
  }
  </code></pre>
  
  <p>the LS is the linked list that stores Nodes. and a Node is a struct that holds the address of my pointer and a pointer to the next Node.<br>
  am i using int *k to store the address of my pointer correctly? should i continue with this implementation or is there any easier way to do this?</p>