← Questions
Boolean expression tree with leaf flips
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding