Add the following method to the LinkedBinaryTree class:
def leaves_list(self)
When called on a tree, it will create and return a list, containing the values stored at the leaves of the tree, ordered from left to right. For example, if called on the tree from question 1, it should return: [5, 1, 8, 4]
Implementation requirement: 1. Your method should run in linear time.