You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
goungoun edited this page Aug 1, 2024
·
4 revisions
Choosing recursion solves certain problems much easier than using a stack or a queue (using deque).
Here is an example:
Problem: https://leetcode.com/problems/symmetric-tree/description/
Solution: https://github.com/goungoun/leetcode/blob/main/Tree/symetric_tree.py