In a directed acyclic graph visualization, the 'reachability' of node $v$ is the number of nodes $u$ such that there is a path from $u$ to $v$. If the graph is a tree with $N$ nodes, what is the maximum possible reachability of the root node?