Boolean expression tree with leaf flips
A tree's leaves hold true or false and its inner nodes are boolean operators. Evaluate the tree, then find the fewest leaf flips that make the root come out to a wanted value.
GoogleCodingNo answer yet. Write the first one; the best answer gets endorsed.