findLCA python. To implement a function that can calculate the lowest common ancestor in a graph, that may be structured as a binary tree.
Follow the instructions from the lecture.
Following completion of this first step, you should then add unit test code to each repository that tests the implementation . Grading awarded based on quality of test code.
Your work should be completed in a github or bitbucket repository . You should submit the Https link to the repository in your submission along with any information you wish us to be aware of. Retain your repository until we haver advised you that we no longer need it.