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), and modify it to also provide the zigzag level order traversal (left…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.