Stack Implementation - Array

preview_player
Показать описание
In this video I discuss how to implement a dynamic stack using an array. I cover operations such as push, pop, peek, isEmpty, resize, and isFull. I also cover Big O Time and Space complexity for all of these operations.
Рекомендации по теме
Комментарии
Автор

Hey Everyone! Thanks for checking out my video! Don't forget to Like, Subscribe, and MOST IMPORTANTLY click that Notification Bell for updates! :)

BlueTreeCode
Автор

That’s the best explanation video I’ve seen so far, thank you so much!

alisayar_
Автор

Isn't top variable obsolete? The top will be always size-1

jakmazdev
Автор

May I ask why three instance variables are using private and the Push method using ++top(because you want top immediately increase by 1?)

alexlfo
Автор

Kevin, do you know how to make interface files for LinkedList, Stack and Queue with all-around functionalities?

eoghanfeighery
Автор

Can u explain abstract classes-polymorphism from hackerrank

radhaiahb
visit shbcf.ru