lecture3-1 - Dr.YingwuZhu OurFocus Queueclass,...

Info icon This preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
    Review of Stacks and Queues Dr. Yingwu Zhu
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
    Our Focus Only link-list based implementation of Stack class Won’t talk about different implementations of  Queue class, see Textbook for details!
Image of page 2
    How does a Stack Work? Last-in-First-out (LIFO) data structure Adding an item Push operation  Removing an item Pop operation Properties Ordered collection of items Be accessed at only the top
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
    Building a Stack Class Design a stack class   stack.h (header file) Implement the stack class   stack.cpp (implementation  file)
Image of page 4
    Building a Stack Class Need to determine the  data structure  to store data items  (array or linked list?) Need to determine the  algorithms  to perform operations  on the data items
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
    Building a Stack Class What data items do we need? An array/linked-list to hold stack elements An integer/pointer to indicate the top of stack What operations do we need? Constructor: build an empty stack Empty: check if a stack is empty Push: add an element on the top Top: return the top element Pop: remove the top element Display: show all the stack elements
Image of page 6
    A Static Array-Based Stack (p327) A static array to hold the stack elements, the position 0 as  the bottom of the stack Problem?   the stack capacity cannot be changed during  run time (waste of space or insufficient room for more  data items)
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
    Dynamic Array-Based Stack Advantage:  allow users to specify the stack capacity in its  declaration But, we need to do more ! (Due to the dynamically- allocated memory)
Image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern