Question: 4. (15 points) Design an algorithm and implement it in C++ to find the first (deepest) common ancestor of three nodes in a binary tree.

4. (15 points) Design an algorithm and implement it in C++ to find the first (deepest) common ancestor of three nodes in a binary tree. Your algorithm should take three nodes as input and return their first (deepest) common ancestor. NOTE: This is not necessarily a binary search tree
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
