Which of the three classic traversal algorithms yields a sorted list if applied to a binary search tree? Prove this property with an example.

Binary tree sort employing a self-balancing binary search tree takes O(n log n) time in the worst scenario, slower than merge sort.

30. In the implementation for a breadth-first search we studied, a queue was used. The code below replaces the queue with a stack. List the pre-order enumeration that the vertices in the graph below are visited using this modified method, starting from vertex 0. } 3 /** stack-based search */ static void modSearch (Graph G, int start) { Stack S new AStack (G.n()); S.push(start); } 6 G.setMark (start, VISITED); while (S.length) > 0) { } modSearch: intv S.pop(); PreVisit (G, v); for (int w = G.first (v); w < G.n(); w = G.next(v, w)) if (G.getMark (w) == UNVISITED) { G.setMark (w, VISITED); S.push(w);

Even when employing a self-balancing binary search tree to construct binary tree sort, the worst-case time required is O(n log n), making it slower than merge sort.