1. Explain the DHCP process.
2. Given the root of a binary search tree (BST) and a key, delete the node with the given key in the BST. Return the root of the BST after the deletion.
3. How do you implement a stack using a queue and vice versa?
4. How did you find out that Software Engineering and Computer Science are your favorite fields?