Leetcode - N-ary Tree Preorder Traversal (Python)

April 2021 Leetcode Challenge Leetcode - N-ary Tree Preorder Traversal #589 Difficulty: Easy Update: I realized as I was uploading this that you can avoid doing the appendleft by using pop() instead of popleft()