Ya i am,,, well thanx for the pseudocode thomax... I have know understand the concept of insertion and deletion in the linked list.. here are the algorithms...
Algorithm of insertion q=getnode() info(q)=x next(q)=list list=q Algorithm of deletion q=list list=next(q) x=info(q) freenode(q) But i have problem while implementing it with pointers... > > Well, Brett did request that their post be trimmed ;-) > > At least the OP was listening. > > ~Rick > > > >ya i am learning it from book > > > > > > > >------------------------------------ > > > >To unsubscribe, send a blank message to > ><mailto:[email protected]>.Yahoo! Groups Links > > > > > > >
