Subsets, with and without backtracking
Return every subset of a set of distinct numbers using backtracking, then write it again iteratively, without backtracking, by building subsets up or using bit masks. Reported in a loop that also asked a tree traversal on a class you define and a simple BFS.
No answer yet. Write the first one; the best answer gets endorsed.
