* binary tree has O(log) lookups, inserts, and removals * sorted array has O(log) lookups and O inserts and removals * sorted array probably has lower coefficient for lookups, although we don't ...

"Convective Self-Assembly of 2D Nonclose-Packed Binary Au Nanoparticle Arrays with Tunable Optical Properties"). They modulated the convective self-assembly of colloidal nanoparticles on a templating ...