Ques 1 : Do you know Binary search tree.
Ques 2 : Difference between Binary Tree and Binary Search Tree.
Ques 3 : Given two words A and B, and a dictionary, C, find the length of shortest transformation sequence from A to B such that you must change exactly one character in every transformation and each intermediate word must exist in the dictionary C. You can see the problem here.
After these coding problems he starts asking from my resume.
Ques 4 : Tell me about your previous internships you have done.
Ques 5 : He asks few questions from javascripts like callbacks etc.

Ques 6 : What is SQL, what are all types of joins in SQL. What is the use of self-join in SQL?