05-17 LeetCode 429. N-ary Tree Level Order Traversal Traverse the Tree Level by Level: Standard BFS Solution
05-15 LeetCode 1302. Deepest Leaves Sum 2 Approaches: BFS(Level Order Travesal) and DFS(Get Max Depth, then Traversal)
05-13 LeetCode 117. Populating Next Right Pointers in Each Node II 3 Approaches: BFS, BFS + LinkedList, Recursion
02-16 LeetCode 114. Flatten Binary Tree to Linked List 3 Approaches: PreOrder, Iteration and Recursion