DP on a tree

• A

  Best for a node, computed by level from the root downwards

• B

  Best for each depth, since nodes at one depth are never adjacent

• C

  Best for a node alone, since whether it was taken is known from its value

• D

  Best for a node, with and without taking it, computed after its children