![]() Note the performance of both Array and Linked List based implementation of Stack is same. To summarize, the time and space Complexities of Stack are: Operation It is an essential part of every program as all the programming languages internally use stack for function calls and many more operations. Stack is a very useful data structure with many uses. Space Complexity of Peek Operation is O(1) as no additional space is required for it.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |