Question: 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
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 [X7, X17, X9]
The three nodes should be listed from smallest to biggest value, eg, [7, 17, 9] is saying that X7 is the third largest value in the tree, X17 is the second largest and X9 is the largest.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
