Recently a friend of mine was asked this question during his interview with one the top e-commerce companies.\n\nIt goes something like this : \n\nWrite a program for to create a directory of an organization where an employee will have attributes id, name, position and manager. Two main features need to be implemented i.e. \n\n1) Searching on the basis of name.\n\n2) Prefix search for the name should also be supported.\n\n 3) For any employee list all the subordinates. Example for the CEO all the employees should get listed.\n\nMy Approach : Store the employee records in an N-ary Tree.  The current manager becomes the parent. For a quick name look up and insertion, use a hash table something like unordered_map<string (name), vector<Node> >.\nAdditionally a sepreate trie for prefix based listing. Any thoughts on a better approach?

Recently a friend of mine was asked this question during his interview with one the top e-commerce companies.\n\nIt goes something like this : \n\nWrite a progr