153. OCR A Level (H046-H446) SLR25 – 2.3 Representing, adding & removing from queues & stacks
About this video
This video starts by showing you in a visual way how to represent a stack and queue and then talks you though the pseudocode for adding items to and removing items from these data structures.
Last updated: 28.02.25
Other videos on this course
-
146. OCR A Level (H046-H446) SLR25 – 2.3 Analysis &design of algorithms
-
147. OCR A Level (H046-H446) SLR25 – 2.3 Standard algorithms
-
148. OCR A Level (H046-H446) SLR25 – 2.3 Algorithms for the main data structures
-
149. OCR A Level (H046-H446) SLR25 – 2.3 Implement linear search
-
150. OCR A Level (H046-H446) SLR25 – 2.3 Implement binary search