Q1. Given a binary tree, compact the space required. The point is that a tree node contains a (4 bytes of data, 4 bytes of left pointer, 4 bytes of right pointer). Therefore, to store 4 bytes of data, you require 12 bytes. Q2. A lot of questions on tree and graph traversal algorithms and the differences between them, with a lot of emphasis on time complexities. Q3. Given an array “cleanTitles” consisting of titles such as “Software Engineer”, “Mechanical Engineer” and so on. You are then provided with a “rawTitle” for eg, “Require a software engineer, paying $10000”. You are supposed to find which cleanTitle that has the most overlapping words (this is the scoring function) and then return that clean title.