Given the following recursive method, what would be the output assuming that the root is the passing value to node parameter

private int unknown(Node node)

{ if (node == null) return 0;

else return( 2*node.data + unknown(node.left));

}