1) Based on the stack data structure, establish a sequential stack and a linked stack respectively and implement basic operations on them (such as popping and pushing); 2) Based on the queue data structure, establish a linked queue and a circular queue respectively, and complete basic operations on them (such as entering and exiting the queue); 3) Refer to the expression evaluation example on P80, and use the basic operations of the stack to implement simple expression evaluation operations and the simulation process of entering and exiting the stack (give the change process of the stack during the program execution); 4) Read the implementation of the stack and recursion on P83 and the 3rd-order Tower of Hanoi problem. Use the stack data structure to solve the 3rd-order Tower of Hanoi problem, write a program and simulate the stack and the transportation process of the Tower of Hanoi (give the change process of the stack and the movement status of the disk during the program execution). 5) Use the circular queue to print the Pascal\'s triangle (refer to P96)
You Might Like
Recommended ContentMore
Live replay: Keysight's small probes, big knowledge, don't let the probes drag down your test results!
Control System Simulation and CAD
MIT 6.622 Power Electronics
Live playback: Wireless networking solution based on Infineon AIROC™ CYW20829 low-power Bluetooth chip
Live replay: ADI & WT·World Health MCU Pain Point Exploration Season: MCU application problems are solved with all our strength!
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore
EEWorld
subscription
account
EEWorld
service
account
Automotive
development
circle
About Us Customer Service Contact Information Datasheet Sitemap LatestNews
Room 1530, 15th Floor, Building B,
No.18 Zhongguancun Street,
Haidian District,
Beijing, Postal Code: 100190
China
Telephone: 008610 8235 0740
京公网安备 11010802033920号
