Problem 1106 · Hard

Parsing A Boolean Expression

Read the expression with a recursive descent: each operator collects its operands, then combines them with NOT, AND or OR.

Open the interactive visualisation