Given the root of a binary tree, return its level order traversal as an array of arrays (each subarray is one level of node values).