A thief is attempting to rob houses arranged in a binary tree structure. Each house is a node in the tree, and two directly-linked houses cannot be robbed in the same night. The goal is to determine the maximum amount of money the thief can rob without alerting the police, starting from the root of the tree.
Click Run to execute sample tests.