0
点赞
收藏
分享

微信扫一扫

数据结构——链表、栈

非凡兔 2022-01-31 阅读 58

 链表:

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 条评论