Open esheetaparulekar opened 2 years ago
Question: 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).
Example: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]]
Could you please assign it to me under Hacktoberfest 2021?
can i work on this, i will provide you with well detailed java solution
Question: 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).
Example: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]]
Could you please assign it to me under Hacktoberfest 2021?