You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. -Print the maximum element in the stack. 3 Input Format The first line of input contains an integer, N. The next N lines each contain an above mentioned query. (It guaranteed that each query is valid.) Constraints 1 ≤ N≤ 105 1 ≤ x ≤ 10⁹ 1 ≤ type ≤ 3 Output Format For each type 3 query, print the maximum element in the stack on a new line.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
