Reverse alternate levels, distance K nodes, and circular tour
Filed under OYO
The question
Reverse alternate levels of a binary tree, print all nodes at distance k from a given node in a binary tree, and find a tour that visits all petrol stations.
No write-up yet. Related questions below have one.
Related OYO questions
Collected from public candidate posts and coding forums. Updated Nov 2026.