Skip to content

Latest commit

 

History

History
10 lines (6 loc) · 428 Bytes

README.md

File metadata and controls

10 lines (6 loc) · 428 Bytes

SoftwareEngineering

Task:

To implement a function that can calculate the lowest common ancestor in a graph, that may be structured as a binary tree. Then add unit test code to each repository that tests the implementation.

My implementation:

I have decided to implement the solution with the unit testing using Java. The main lca function has came from a resource online, and unit tests were added to match the function.