Algorithms } 04 } Bags, Queues, and Stacks }

This lecture covers very basic concepts about bags, stacks and queues in nutshell. You may have known these concepts already. Just a note that when I discuss stacks I was explaining compiler example for stack, it just for example a partial stack. More detailed stack implementation as compiler does is not explained here. Also, I noticed after recording the video that I missed the operator on stack in one example which should have been like that:

| ) |
—-
| c |
—–
| + |
——
| b |
——
| ( |
—–

Stack and queues are important concepts and there are variants of these data structure you may come across.

Click above and [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂

Sincerely,
H.

2,564 total views, 6 views today

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

 

 

 

 

www.youtube.com/Leprofesseur

 

Knowledge at your fingertips } Rethink the way you learn }™     Leprofesseur }
Skip to toolbar