Look, Ma, no queues!Published onOctober 12, 20244 min read A very classic, if a bit overrated exercise, is to print a tree in width-first order. Also called level-order, it means you print your binary tree ro...levelqueues
