Given the root of a binary tree, return its node values level by level, from left to right, as a list of lists (one list per depth).