Given the root of a binary tree, return the level order traversal as a list of lists (each inner list contains node values at that depth).