TIPS FOR LINKED LISTS, STACKS AND QUEUES
Hello Friends, Data Structures are like solving Puzzles. You have to use your brain's Logic Unit and find the solution of the given problem. Many students find data structures hard to understand. This is because they don't want to use their brains for solving the given problems. If you love solving puzzles and taking new challenges, then gear up and start reading each line of this chapter. This chapter No.10 consists of 6 marks for your Boards exam. You will be asked one question from Stacks for 2 marks and one question from Queues for 4 marks . The 2 marks question from stack will ask you to either " convert the given infix notation to postfix notation " or to " evaluate the given postfix expression " or to " write a code for a linked stack ". This question based on postfix notations is very easy to solve as you have to follow some simple steps and rules for solving the problem. For writing the code of Linked Stack, you have to
