Summary

Inserts values into a self-adjusting splay tree, then traverses it in order.

How it Works

• Splay the nearest searched node to the root.

• Insert each value at the root or increase its duplicate count.

• Traverse the tree in order to output values.