HCLTech Python Developer interview questions

I was contacted via Naukri.com First round: Questions were provided on mail and was asked to send the solution of GitHub Questions were: 1) Least Common Ancestor 2)BFS Traversal 3) Reducing a string so that no adjacent duplicates should be together For eg : "aaba" output will be "ba" Second Round: 1)Initial discussions on above questions 2)DFS Traversal 3)String aabbccaaa to be printed like "a2b2c2a3" i.e. length to be appended of a variable 4)BFS Traversal : print elements level wise For eg: 2 1 4 3 5 Third Round: Create binary search tree , pass Linked link and using bst return sorted list . can be done using inorder traversal