Answer:
Explanation:
In such a dataset, the individual dogs that lived the longest lives would be at the deepest level of the data tree. Therefore, you would need to traverse the tree and grab all of the nodes at the deepest level and add them to a new list. This list will, therefore, have all the dogs that lived the longest lives. You would need to traverse the farthest left side of the tree until you reach the deepest node, then return and traverse the tree again on the left-right node to see if goes deeper. Once you reach the deepest node in each attempt you add it to the list.
