House Robber III

Houses form a binary tree and the thief cannot rob two directly linked houses. Given the tree in level-order form (values are money), print the maximum amount that can be robbed.

1 <= number of nodes <= 10^4 0 <= value <= 10^4