Tree Sort

input: sequence S

output: sorted S

1. t = makeNode(first(S));

2. remove the first element from S;

3. for each element x in S {

insertSearchTree(t,x);

}

4.inorderTraverse(t);