The interviewer started by asking me to introduce myself. He then asked me my favorite subject, to which I replied DSA. He asked me to give real-life applications of merge sort. He further asked me to compare merge sort with other sorting algorithms with respect to their time complexity, best, worst, and average cases. Once he was satisfied, he went on to OOPS and asked me a lot of questions on OOPS. Inheritance, Polymorphism, Dynamic binding, and almost everything related to OOPS. One question was Given a Binary Tree, the task is to print the left view of the Binary Tree. The left view of a Binary Tree is a set of leftmost nodes for every level.