A Queue is a structure that follows some restrictions on insertion and deletion. It is an ordered list that follows the principle FIFO (First In -First Out). Dynamic: The dynamic implementation of the stack can be done with the help of a linked list.Ī Queue is a linear data structure.Static: The static implementation of the stack can be done with the help of arrays.There are two ways to implement the stack: We need to allocate the memory to get the size of the stack. To implement the stack, we should know the size of the stack. In stack, the top is a pointer which is used to keep track of the last inserted element. isFull(): If the stack is full, then this function will return a true value or else it will return a false value.isEmpty(): If the stack is empty, then this function will return a true value or else it will return a false value.Like pop(), it returns the value of the topmost element but does not remove that element from the stack.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |