Botree Software International Interview Questions and Answers

Invert a binary tree with a given leaf node as the new root, following specific guidelines.

• Start by identifying the leaf node provided in the input.

• Follow the guidelines to invert the binary tree with the leaf node as the new root.

• Ensure that the left child becomes the right child of the new root if available, and the parent becomes the left child.

• Implement the inversion process for each test case and output the resulting binary tree in the same format as the input.

Merge two sorted arrays into one sorted array in place.

• Iterate from the end of both arrays and compare elements to merge in place

• Use two pointers to keep track of the current position in each array

• Update the elements in ARR1 from the end to the beginning

Identify the deepest left leaf node in a binary tree.

• Traverse the binary tree in level order to find the deepest left leaf node.

• Keep track of the maximum depth and the value of the deepest left leaf node found so far.

• Return the value of the deepest left leaf node at the end.

The task is to determine if a given string consisting of parentheses is balanced or not.

• Iterate through each character in the string and use a stack to keep track of opening parentheses

• If an opening parenthesis is encountered, push it onto the stack

• If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else return 'Not Balanced'

• At the end, if the stack is empty, return 'Balanced', else return 'Not Balanced'

Reverse a 32-bit signed integer and handle overflow cases.

• Implement a function to reverse the given integer.

• Check for overflow conditions and return -1 if overflow occurs.

• Use 32-bit capacity data types only.

• Example: For input 123, output should be 321.