Application Engineer 2 Interview Questions and Answers

Transform node values in a tree problem

• Traverse the tree using depth-first search or breadth-first search

• At each node, apply the transformation function to update the node value

• Consider using recursion for tree traversal and transformation

• Example: Increment each node value by 1 in a binary tree

Implementing sorting algorithm using linked list

• Create a linked list data structure to store elements

• Implement the sorting algorithm (e.g. bubble sort, merge sort) using linked list operations

• Update the pointers accordingly to rearrange the elements in sorted order