Google L3 | Phone Screen | Reject

Round 1

Questions: Given a Binary Tree whose nodes could be one of the following AND, OR, NOT, XOR. Unary for NOT node.
Leaves will have a value as true or false.
Need to evaluate the tree value and get final result array by toggling all the leaves node. i.e true to false or false to true one by one.