intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE
 » 
 » 

Lecture Data Structures & Algorithms: Chapter 6

Chia sẻ: Na Na | Ngày: | Loại File: PPTX | Số trang:18

Thêm vào BST
Báo xấu
69
lượt xem 2
download
 
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

Lecture Data Structures & Algorithms: Chapter 6 - Stacks & Queues (Use Array to implement Stacks & Queues, Use Linked list to implement Stacks & Queues) presented Stacks, Queues and other content. Invite you to read the lecture.

Chủ đề:

Bình luận(0) Đăng nhập để gửi bình luận!

Lưu

Nội dung Text: Lecture Data Structures & Algorithms: Chapter 6

  1. DONG NAI UNIVERSITY OF TECHNOLOGY Data Structures & Algorithms 1
  2. DONG NAI UNIVERSITY OF TECHNOLOGY Stacks & Queues Use Array to implement Stacks & Queues Use Linked list to implement Stacks & Queue 2
  3. DONG NAI UNIVERSITY OF TECHNOLOGY Stacks • LIFO (last in first out) 3
  4. DONG NAI UNIVERSITY OF TECHNOLOGY Managing Top element 4
  5. DONG NAI UNIVERSITY OF TECHNOLOGY Basic operations: Initialize CreateNode Push Pop 5
  6. DONG NAI UNIVERSITY OF TECHNOLOGY typedef struct Node { int data; Node *pLink; Initialize }; typedef struct Node *STACK; void initialize(STACK &stack) { stack=NULL; } 6
  7. DONG NAI UNIVERSITY OF TECHNOLOGY Node *createNode(int d) { Node *pNode=new Node; pNode->data=d; CreateNode pNode->pLink=NULL; } 113 pNode pLink NULL 7
  8. DONG NAI UNIVERSITY OF TECHNOLOGY Push void push(STACK &stack,int d) { Stac 114 k Node *pNode=createNode(d); pLink pNode 114 if(stack==NULL) pLink { stack=pNode; NULL } Stac k else 113 113 { pLink pLink pNode->pLink=stack; stack=pNode; } NULL NULL} 8
  9. DONG NAI UNIVERSITY OF TECHNOLOGY Pop Stac int pop(STACK k 114 114 &stack) 114 pDel { pLink pLink pLink int d=stack->data; Stac NULL Node *pDel=stack; Stac NULL k k stack=stack- 113 113 113 >pLink; pLink pLink pLink pDel- >pLink=NULL; NULL NULL NULL delete pDel; return d; } 9
  10. DONG NAI UNIVERSITY OF TECHNOLOGY void main() { STACK stack; initialize(stack); push(stack,5); push(stack,7); push(stack,1); cout
  11. DONG NAI UNIVERSITY OF TECHNOLOGY Queues l FIFO (first in first out) 11
  12. DONG NAI UNIVERSITY OF TECHNOLOGY Queues 12
  13. DONG NAI UNIVERSITY OF TECHNOLOGY Basic operations: Initialize CreateNode Insert Get 13
  14. DONG NAI UNIVERSITY OF TECHNOLOGY typedef struct Node { int data; Node *pLink; }; typedef struct QUEUE Initialize { Node *pFront; Node *pRear; }; void initialize(QUEUE &queue) { queue.pFront=NULL; queue.pRear=NULL; } 14
  15. DONG NAI UNIVERSITY OF TECHNOLOGY Node *CreateNode(int d) { Node *pNode=new Node; if(pNode==NULL) CreateNode { coutpLink=NULL; } 15
  16. DONG NAI UNIVERSITY OF TECHNOLOGY void Insert(QUEUE &queue,int d) { Node *pNode=CreateNode(d); if(queue.pFront==NULL) { Insert queue.pFront=queue.pRear=pNode; } else { queue.pRear->pLink=pNode; queue.pRear=pNode; } } 16
  17. DONG NAI UNIVERSITY OF TECHNOLOGY int Get(QUEUE &queue) { int d=queue.pFront->data; Node *pDel=queue.pFront; Get queue.pFront=queue.pFront->pLink; pDel->pLink=NULL; delete pDel; return d; } 17
  18. DONG NAI UNIVERSITY OF TECHNOLOGY END 18
ADSENSE

CÓ THỂ BẠN MUỐN DOWNLOAD

THÔNG TIN
TRỢ GIÚP
HỖ TRỢ KHÁCH HÀNG
Theo dõi chúng tôi

Chịu trách nhiệm nội dung:

Nguyễn Công Hà - Giám đốc Công ty TNHH TÀI LIỆU TRỰC TUYẾN VI NA

LIÊN HỆ

Địa chỉ: P402, 54A Nơ Trang Long, Phường 14, Q.Bình Thạnh, TP.HCM

Hotline: 093 303 0098

Email: support@tailieu.vn

Giấy phép Mạng Xã Hội số: 670/GP-BTTTT cấp ngày 30/11/2015 Copyright © 2022-2032 TaiLieu.VN. All rights reserved.

 

Đồng bộ tài khoản
2=>2