Intern

Step 1 : I used bitwise shift operators here. I first ran a loop for 'i' from 0 to 32 (as 32 bits is maximum)
Step 2 : Then right shifted the bits of both numbers by 'i' places.
Step 3 : Checked whether the bit at 0th position is different, if yes then increase the counter variable.
Step 4 : Using bitwise AND by 1 for both numbers to get the 1st bit.
Step 5 : Displayed the count.

Step 1 : I used Java to code the given problem for all three cases of node deletions.
Step 2 : For the time complexity, the worst case time complexity of delete operation is O(h) where h is height of Binary Search Tree. In worst case, we may have to travel from root to the deepest leaf node. The height of a skewed tree may become n and the time complexity of delete operation may become O(n).
Step 3 : In case of code optimization, instead of recursively calling delete() for successor, we can avoid recursive call by keeping track of parent node of successor so that we can simply remove the successor by making child of parent as NULL. We know that successor would always be a leaf node.

Tip 1 : Go through the concepts and their implementation.
Tip 2 : Be thorough with the working of various algorithms.

Tip 1: Don’t be afraid to be candid and assertive because those are the precise qualities the HR recruiter is looking to assess in you.
Tip 2: Prepare yourself to discuss and provide lots of examples to back up your experience.