Page 5 - Data Structures Interactive Book
P. 5

4.5  Applications of Linked Lists .................................................................................. 40

                       4.6  Limitations of Linked Lists .................................................................................... 40

                       4.7  Summary ................................................................................................................ 41

                       4.8  Exercise .................................................................................................................. 42

                     CHAPTER 5  STACKS ..................................................................................................... 44


                          5.1.1  Introduction to Stacks ..................................................................................... 45


                          5.1.2  Definition and Characteristics ........................................................................ 45

                       5.2  Implementation of Stacks ....................................................................................... 45

                          5.2.1  Stack Using Arrays ......................................................................................... 45


                          5.2.2  Stack Using Linked Lists ................................................................................ 46

                       5.3  Operations on Stacks .............................................................................................. 47


                          5.3.1  Push Operation ................................................................................................ 47

                          5.3.2  Pop Operation ................................................................................................. 47


                          5.3.3  Peek/Top Operation ........................................................................................ 47

                          5.3.4  Checking for Empty and Full Conditions ....................................................... 47


                       5.4  Applications in Computer Science ......................................................................... 48

                          5.4.1  Expression Evaluation (Postfix, Prefix, Infix) ................................................ 48


                          5.4.2  Balanced Parentheses Checking ..................................................................... 48

                          5.4.3  Function Call Management (Recursion) ......................................................... 48


                       5.5  Limitations of Stacks .............................................................................................. 48

                       5.6  Summary ................................................................................................................ 49


                       5.7  Exercise .................................................................................................................. 50

                     CHAPTER 6  QUEUES ..................................................................................................... 52


                       6.1   Introduction to Queues ............................................................................................. 53

                            6.1.1   Definition and Characteristics ...................................................................... 53







                                                             5
   1   2   3   4   5   6   7   8   9   10