Consider the following definition of a tree node and a recursive method applied to a tree node n : int method(node n ) \{ if (node==null) return 0; if (node.left == null \& node.right == null) return 1; return method(node.left) + method(node.right); \}