Refactoring The Node Class From The Previous Question As Needed, Implement The Method ToOrderedST To Return The ST As An Ordered ST Node[] In O(Nlog(N)) Time. Your Answer Should Include Both Your Refactored Node Class (If Needed) And Your Implementation For ToOrderedST. *Note: The Formal Parameter 'N' Is The Total Number Of Nodes* Public Node[]

Refactoring the Node class from the previous question as needed, implement the method toOrderedST to return the ST as an ordered ST Node[] in O(nlog(n)) time. Your answer should include both your refactored Node class (if needed) and your implementation for toOrderedST. *note: the formal parameter 'N' is the total number of nodes* public Node[] toOrdererdST(Node root, int N){ //implement me }