#Dsa 2

Build a solution for finding the Lowest Common Ancestor in a Binary Tree from scratch, constructing the tree yourself with hints from the interviewer.

Discuss a problem similar to 'Rotting Oranges', including two levels of optimization. Explain the time and space complexity in detail.

Discuss and solve a BFS problem that is similar to the Bus Routes problem, though the exact question details were not remembered.

Implement a function to reverse a linked list in groups of size k. For example, given the linked list A → B → C → D → E and k = 2, the output should be B → A → D → C → E. If the remaining nodes are less than k, they should remain unchanged.

Solve a medium-level tree traversal problem.