Section 1: Objective (MCQs) Infix to Postfix: There were 2 MCQs on converting expressions. Make sure you know the operator precedence (especially Exponent ^). Tree Depth: 2 MCQs asked to calculate the depth of a given tree diagram. Leaf Nodes: 3 MCQs provided data sets like [20, 39, 45, 67, 12] and asked to identify which one would be the leaf node in a specific BST scenario. Good Analyzer: One question asked which data structure is considered a "good analyzer" (Options: Stack, Queue, Function, Variable). Tip: Stack is usually the answer for expression parsing/analysis. Tree Identification: A tree diagram was given, and I had to identify its type (Full, Strict, or Complete Binary Tree). Syntax & Output: 2 MCQs were about C++ syntax, and the rest required predicting the output of small code