🔢
Algorithms & Data
⌘Ctrlk
🔢
Algorithms & Data
    • 1. Sort
    • 2. Data Structures
    • 3. How to construct Algorithm? Paradigm
    • Problem Sources
    • AlgoExpert
    • Daily Algorithms
    • Source
    • Problems
      • Interval
      • Heap
      • Array
      • Binary
      • Graph
      • Tree
        • x 297. Serialize and Deserialize Binary Tree
        • x 105. Construct Binary Tree from Preorder and Inorder Traversal
        • x 212. Word Search II
        • 211. Design Add and Search Words Data Structure
        • 208. Implement Trie (Prefix Tree)
        • 235. Lowest Common Ancestor of a Binary Search Tree
        • 230. Kth Smallest Element in a BST
        • 98. Validate Binary Search Tree
        • 572. Subtree of Another Tree
        • 297. Serialize and Deserialize Binary Tree ?
        • 102. Binary Tree Level Order Traversal
        • 124. Binary Tree Maximum Path Sum
        • 226. Invert Binary Tree
        • 100. Same Tree
        • 104. Maximum Depth of Binary Tree
      • Dynamic Programming
      • String
      • Matrix
      • Linked List
    • Page 2
    • LinkedList
Powered by GitBook
For the complete documentation index, see llms.txt. This page is also available as Markdown.
  1. Top 75 LeetCode Questions to Save Your Time
  2. Problems

Tree

x 297. Serialize and Deserialize Binary Treex 105. Construct Binary Tree from Preorder and Inorder Traversalx 212. Word Search II211. Design Add and Search Words Data Structure208. Implement Trie (Prefix Tree)235. Lowest Common Ancestor of a Binary Search Tree230. Kth Smallest Element in a BST98. Validate Binary Search Tree572. Subtree of Another Tree297. Serialize and Deserialize Binary Tree ?102. Binary Tree Level Order Traversal124. Binary Tree Maximum Path Sum226. Invert Binary Tree100. Same Tree104. Maximum Depth of Binary Tree
Previous200. Number of IslandsNextx 297. Serialize and Deserialize Binary Tree

Last updated 6 months ago