数据结构——链表、栈

非凡兔

关注

阅读 58

2022-01-31

 链表:

pHead = (( pStu ) malloc( sizeof( Stu ) )

pHead->pNext = NULL

pTail = pHead

pNew =(( pStu ) malloc( sizeof( Stu ) )

pTail->pNext = pNew

pNew->pNext = NULL

pTail = pNew

栈:

pStack->pTop = ( pNODE ) malloc( sizeof ( NODE ) )

pStack->pButton = pStack->pTop

pNODE pNew = ( pNODE ) malloc( sizeof ( NODE ) )

pNew->date = val

pNew->pNext = pStack->pTop

pStack->pTop = pNew

精彩评论(0)

0 0 举报