Assuming the graph given above is a valid Binary Search Tree (BST) list the nodes containing the three largest values in the tree (in ascending order of value).

Notes:

Your answer should be a valid python list of integers, eg, [7, 17, 9] is in the valid format and is shorthand for [X₇, X₁₇, X₉]

The three nodes should be listed from smallest to biggest value, eg, [7, 17, 9] is saying that X₇ is the third largest value in the tree, X₁₇ is the second largest and X₉ is the largest.