Round 1 -
Rob house in binary tree

Round 2 -
Given an input stream of boolean values, design a data structure that can support following modules in optimal time

• setTrue(index)
• setFalse(index)
• setAllTrue()
• setAllFalse()
• getIndex(index)