Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!tut.cis.ohio-state.edu!pt.cs.cmu.edu!o.gp.cs.cmu.edu!andrew.cmu.edu!rg2c+ From: rg2c+@andrew.cmu.edu (Robert Nelson Gasch) Newsgroups: comp.lang.c Subject: Genralizing Pointer Routines Message-ID: Date: 11 Dec 90 06:41:17 GMT Organization: Class of '91, Carnegie Mellon, Pittsburgh, PA Lines: 11 I have a question concerning dynamically allocated data structures. An aquaintance told me this was possible, but did now know the deatils. In PASCAL, if you have 3 linked lists of different pointer types, you have to write 3 different Insert, search & delete routines; one for each pointer type. I was wondering if these routines can be generalized for any pointer type in C? This would mean that you could write each routine only once, which would then operate on all 3 pointer types. If this can be done, what are the details involved?? Thanx ---> Rob