Cartesian Tree Adaptive Sort
Sort by building a Cartesian tree that captures local order, then extracting elements in sorted order.
Tag
Tree-Sort
4 notes
Binary Tree Online Sort
Maintain a sorted sequence by inserting elements into a binary search tree as they arrive and extracting them in order.
Cartesian Tree Sort
Sort by building a Cartesian tree and extracting elements via inorder traversal.
Tree Sort
Insert all elements into a binary search tree, then traverse the tree in sorted order.