[{
        "title": "Maximum Depth of Binary Tree",
        "url": "https://leetcode.com/problems/maximum-depth-of-binary-tree/",
        "difficulty": "Easy",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Same Tree",
        "url": "https://leetcode.com/problems/same-tree/",
        "difficulty": "Easy",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Invert Binary Tree",
        "url": "https://leetcode.com/problems/invert-binary-tree/",
        "difficulty": "Easy",
        "tag": "Tree",
        "pattern": ["DFS", "BFS"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Binary Tree Maximum Path Sum",
        "url": "https://leetcode.com/problems/binary-tree-maximum-path-sum/",
        "difficulty": "Hard",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Binary Tree Level Order Traversal",
        "url": "https://leetcode.com/problems/binary-tree-level-order-traversal/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["BFS"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Serialize and Deserialize Binary Tree",
        "url": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree/",
        "difficulty": "Hard",
        "tag": "Tree",
        "pattern": ["DFS", "BFS"],
        "revision": false,
        "solved": false,
        "top100": false,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Subtree of Another Tree",
        "url": "https://leetcode.com/problems/subtree-of-another-tree/",
        "difficulty": "Easy",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": false,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Construct Binary Tree from Preorder and Inorder Traversal",
        "url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Validate Binary Search Tree",
        "url": "https://leetcode.com/problems/validate-binary-search-tree/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Kth Smallest Element in a BST",
        "url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["DFS", "Inorder Traversal"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Lowest Common Ancestor of a Binary Search Tree",
        "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/",
        "difficulty": "Easy",
        "tag": "Tree",
        "pattern": ["DFS", "Recursion"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Implement Trie (Prefix Tree)",
        "url": "https://leetcode.com/problems/implement-trie-prefix-tree/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["Trie"],
        "revision": false,
        "solved": false,
        "top100": true,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Design Add and Search Words Data Structure",
        "url": "https://leetcode.com/problems/design-add-and-search-words-data-structure/",
        "difficulty": "Medium",
        "tag": "Tree",
        "pattern": ["Trie", "DFS"],
        "revision": false,
        "solved": false,
        "top100": false,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": true,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    },
    {
        "title": "Word Search II",
        "url": "https://leetcode.com/problems/word-search-ii/",
        "difficulty": "Hard",
        "tag": "Tree",
        "pattern": ["Trie", "Backtracking"],
        "revision": false,
        "solved": false,
        "top100": false,
        "lovebabbar": false,
        "striver": false,
        "neetcode": true,
        "blind75": true,
        "grind75": false,
        "interviewMemoryTrick": "",
        "notes": "",
        "videoSolution": "",
        "textSolution": ""
    }]