For a complete Binary Search Tree containing real numbers, design an algorithm for computing the width of that tree. (we define the width of a tree as the difference between the largest and smallest numbers in the tree) What is the worst-case runtime for your algorithm ? ( write this as a comment in your code) Note that you are given the tree as a reference to its root. For example: Test Input Result 19 calculateWidth(root) 13 11 10 15 TVIN 1 9 14 20 Answer: (penalty regime: 0, 0, 0, 0, 0, 10, 20, ... %) Reset answer 1-V 2 Ps