Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
[0, 2000]-1000 <= Node.val <= 1000root = [3,9,20,null,null,15,7][[3],[9,20],[15,7]]root = [1][[1]]root = [][]