Sieve of Eratosthenes and Tree conversion without extra space
Filed under Navi
The question
Implement the Sieve of Eratosthenes, and write a code to convert an input tree and return the output tree without using any extra space using reverse inorder traversal.
No write-up yet. Related questions below have one.
Related Navi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.