dsa5 min read
N-ary Tree Preorder and Postorder Traversal — LC 589 and LC 590
LC 589 N-ary Tree Preorder and LC 590 Postorder Traversal generalize binary tree DFS to trees with any number of children. These easy problems build the foundation for harder n-ary tree problems asked at Amazon and Google.
Read →