MCQs 1. Stack (Push, Pop, Peek/Top, Overflow, Underflow, LIFO) 2. Queue (Enqueue, Dequeue, Front, Rear, FIFO) 3. Array (Insertion, Deletion, Traversing, Indexing, Searching) 4. Binary Search Tree (Insertion, Search, Traversal, Root, Leaf Node) 5. Infix & Postfix (Conversion, Operator Precedence, Expression Evaluation) 6. Mathematical Expressions (Prefix, Infix, Postfix, Evaluation) Short Questions 1. Binary Search Tree 2. Short Question of Output(array) Long Questions 1.Array with table: Update array table Show current and index Show size back(), add(200)and next() 2. Find Time Complexity / Time Simulation Reference image will be given