The interview is mostly around data structures and algorithms and almost nothing on machine learning. I don't know why the questions I had posted before got taken down but here they are again. Q.1) What is the difference between a binary tree and binary search tree? Q.2) What is the time complexity to do a insertion and deletion operation in a binary search tree? Q.3) What is the difference between threads and processes? Are they different? Q.4) What are heaps? Q.5) Given a list [2,1,3,4,5,6] what is the fastest sorting algorithm you can use to sort it?