https://leetcode-solutions-5zk.pages.dev/tags/tree/Recent content in Tree on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Hard | Array, String, Divide and Conquer, Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/Hard | Array, Hash Table, Tree, Graph Theory, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1443-minimum-time-to-collect-all-apples-in-a-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0199-binary-tree-right-side-view/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Hard | Hash Table, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0427-construct-quad-tree/Medium | Array, Divide and Conquer, Tree, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0513-find-bottom-left-tree-value/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0559-maximum-depth-of-n-ary-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0559-maximum-depth-of-n-ary-tree/Easy | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0988-smallest-string-starting-from-leaf/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0988-smallest-string-starting-from-leaf/Medium | String, Backtracking, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3241-time-taken-to-mark-all-nodes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3241-time-taken-to-mark-all-nodes/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3249-count-the-number-of-good-nodes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3249-count-the-number-of-good-nodes/Medium | Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3319-k-th-largest-perfect-subtree-size-in-binary-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3319-k-th-largest-perfect-subtree-size-in-binary-tree/Medium | Tree, Depth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/Hard | Array, Hash Table, String, Tree, Depth-First Search, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3331-find-subtree-sizes-after-changes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3331-find-subtree-sizes-after-changes/Medium | Array, Hash Table, String, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3367-maximize-sum-of-weights-after-edge-removals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3367-maximize-sum-of-weights-after-edge-removals/Hard | Dynamic Programming, Tree, Depth-First Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i/Medium | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Hard | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3558-number-of-ways-to-assign-edge-weights-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3558-number-of-ways-to-assign-edge-weights-i/Medium | Math, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/Hard | Array, Tree, Depth-First Search, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/Medium | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Hard | Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/Hard | Array, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3812-minimum-edge-toggles-on-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3812-minimum-edge-toggles-on-a-tree/Hard | Tree, Depth-First Search, Graph Theory, Topological Sort, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3820-pythagorean-distance-nodes-in-a-tree/Medium | Tree, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2973-find-number-of-coins-to-place-in-tree-nodes/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2973-find-number-of-coins-to-place-in-tree-nodes/Hard | Dynamic Programming, Tree, Depth-First Search, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network/Medium | Array, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2641-cousins-in-binary-tree-ii/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/Medium | Array, Dynamic Programming, Greedy, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Hard | Math, Dynamic Programming, Tree, Depth-First Search, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2872-maximum-number-of-k-divisible-components/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2872-maximum-number-of-k-divisible-components/Hard | Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2925-maximum-score-after-applying-operations-on-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2925-maximum-score-after-applying-operations-on-a-tree/Medium | Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/2049-count-nodes-with-the-highest-score/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2049-count-nodes-with-the-highest-score/Medium | Array, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2096-step-by-step-directions-from-a-binary-tree-node-to-another/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2096-step-by-step-directions-from-a-binary-tree-node-to-another/Medium | String, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2196-create-binary-tree-from-descriptions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2196-create-binary-tree-from-descriptions/Medium | Array, Hash Table, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2236-root-equals-sum-of-children/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2236-root-equals-sum-of-children/Easy | Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2265-count-nodes-equal-to-average-of-subtree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2265-count-nodes-equal-to-average-of-subtree/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Hard | Array, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2331-evaluate-boolean-binary-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2331-evaluate-boolean-binary-tree/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2368-reachable-nodes-with-restrictions/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2385-amount-of-time-for-binary-tree-to-be-infected/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2415-reverse-odd-levels-of-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/Hard | Array, Math, Tree, Depth-First Search, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2467-most-profitable-path-in-a-tree/Medium | Array, Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2476-closest-nodes-queries-in-a-binary-search-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2476-closest-nodes-queries-in-a-binary-search-tree/Medium | Array, Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2477-minimum-fuel-cost-to-report-to-the-capital/Medium | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/Hard | Array, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2581-count-number-of-possible-root-nodes/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2581-count-number-of-possible-root-nodes/Hard | Array, Hash Table, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2583-kth-largest-sum-in-a-binary-tree/Medium | Tree, Breadth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/Hard | Array, Tree, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1302-deepest-leaves-sum/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1305-all-elements-in-two-binary-search-trees/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1305-all-elements-in-two-binary-search-trees/Medium | Tree, Depth-First Search, Binary Search Tree, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1315-sum-of-nodes-with-even-valued-grandparent/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1325-delete-leaves-with-a-given-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1325-delete-leaves-with-a-given-value/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1339-maximum-product-of-splitted-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1339-maximum-product-of-splitted-binary-tree/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1361-validate-binary-tree-nodes/Medium | Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/Medium | Linked List, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1372-longest-zigzag-path-in-a-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1372-longest-zigzag-path-in-a-binary-tree/Medium | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1373-maximum-sum-bst-in-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1373-maximum-sum-bst-in-binary-tree/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1376-time-needed-to-inform-all-employees/Medium | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1382-balance-a-binary-search-tree/Medium | Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1448-count-good-nodes-in-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/Medium | Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1519-number-of-nodes-in-the-sub-tree-with-the-same-label/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1530-number-of-good-leaf-nodes-pairs/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1530-number-of-good-leaf-nodes-pairs/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1600-throne-inheritance/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1600-throne-inheritance/Medium | Hash Table, Tree, Depth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1609-even-odd-tree/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1617-count-subtrees-with-max-distance-between-cities/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1617-count-subtrees-with-max-distance-between-cities/Hard | Dynamic Programming, Bit Manipulation, Tree, Enumeration, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Hard | Array, Math, Tree, Depth-First Search, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/Hard | Array, Hash Table, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1993-operations-on-tree/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1008-construct-binary-search-tree-from-preorder-traversal/Medium | Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1022-sum-of-root-to-leaf-binary-numbers/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1022-sum-of-root-to-leaf-binary-numbers/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1026-maximum-difference-between-node-and-ancestor/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1026-maximum-difference-between-node-and-ancestor/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1028-recover-a-tree-from-preorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1028-recover-a-tree-from-preorder-traversal/Hard | String, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1038-binary-search-tree-to-greater-sum-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1038-binary-search-tree-to-greater-sum-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1080-insufficient-nodes-in-root-to-leaf-paths/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1080-insufficient-nodes-in-root-to-leaf-paths/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1104-path-in-zigzag-labelled-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1104-path-in-zigzag-labelled-binary-tree/Medium | Math, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1110-delete-nodes-and-return-forest/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1110-delete-nodes-and-return-forest/Medium | Array, Hash Table, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1123-lowest-common-ancestor-of-deepest-leaves/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1145-binary-tree-coloring-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1145-binary-tree-coloring-game/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1161-maximum-level-sum-of-a-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1261-find-elements-in-a-contaminated-binary-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0783-minimum-distance-between-bst-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0783-minimum-distance-between-bst-nodes/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0814-binary-tree-pruning/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0814-binary-tree-pruning/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0834-sum-of-distances-in-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0834-sum-of-distances-in-tree/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0863-all-nodes-distance-k-in-binary-tree/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0865-smallest-subtree-with-all-the-deepest-nodes/Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0872-leaf-similar-trees/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0872-leaf-similar-trees/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0889-construct-binary-tree-from-preorder-and-postorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0894-all-possible-full-binary-trees/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0894-all-possible-full-binary-trees/Medium | Dynamic Programming, Tree, Recursion, Memoization, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0897-increasing-order-search-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0897-increasing-order-search-tree/Easy | Stack, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0919-complete-binary-tree-inserter/Medium | Tree, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0938-range-sum-of-bst/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0938-range-sum-of-bst/Easy | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0951-flip-equivalent-binary-trees/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0951-flip-equivalent-binary-trees/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0958-check-completeness-of-a-binary-tree/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0965-univalued-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0965-univalued-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0968-binary-tree-cameras/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0968-binary-tree-cameras/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0971-flip-binary-tree-to-match-preorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0971-flip-binary-tree-to-match-preorder-traversal/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0979-distribute-coins-in-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0979-distribute-coins-in-binary-tree/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Hard | Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0993-cousins-in-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0993-cousins-in-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0998-maximum-binary-tree-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0998-maximum-binary-tree-ii/Medium | Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0501-find-mode-in-binary-search-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0501-find-mode-in-binary-search-tree/Easy | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0508-most-frequent-subtree-sum/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0508-most-frequent-subtree-sum/Medium | Hash Table, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0515-find-largest-value-in-each-tree-row/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0530-minimum-absolute-difference-in-bst/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0530-minimum-absolute-difference-in-bst/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0538-convert-bst-to-greater-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0538-convert-bst-to-greater-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0543-diameter-of-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0543-diameter-of-binary-tree/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0558-logical-or-of-two-binary-grids-represented-as-quad-trees/Medium | Divide and Conquer, Treehttps://leetcode-solutions-5zk.pages.dev/posts/0563-binary-tree-tilt/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0563-binary-tree-tilt/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0572-subtree-of-another-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0572-subtree-of-another-tree/Easy | Tree, Depth-First Search, String Matching, Binary Tree, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/0589-n-ary-tree-preorder-traversal/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0589-n-ary-tree-preorder-traversal/Easy | Stack, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0590-n-ary-tree-postorder-traversal/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0590-n-ary-tree-postorder-traversal/Easy | Stack, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0606-construct-string-from-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0606-construct-string-from-binary-tree/Medium | String, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0617-merge-two-binary-trees/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0617-merge-two-binary-trees/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0623-add-one-row-to-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0637-average-of-levels-in-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0637-average-of-levels-in-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0652-find-duplicate-subtrees/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0652-find-duplicate-subtrees/Medium | Hash Table, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0653-two-sum-iv-input-is-a-bst/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0653-two-sum-iv-input-is-a-bst/Easy | Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0654-maximum-binary-tree/Medium | Array, Divide and Conquer, Stack, Tree, Monotonic Stack, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0655-print-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0662-maximum-width-of-binary-tree/Medium | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0669-trim-a-binary-search-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0669-trim-a-binary-search-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0671-second-minimum-node-in-a-binary-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0671-second-minimum-node-in-a-binary-tree/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0687-longest-univalue-path/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0687-longest-univalue-path/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0690-employee-importance/Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0700-search-in-a-binary-search-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0700-search-in-a-binary-search-tree/Easy | Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0701-insert-into-a-binary-search-tree/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0701-insert-into-a-binary-search-tree/Medium | Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0703-kth-largest-element-in-a-stream/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0703-kth-largest-element-in-a-stream/Easy | Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Streamhttps://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0331-verify-preorder-serialization-of-a-binary-tree/Medium | String, Stack, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0337-house-robber-iii/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0337-house-robber-iii/Medium | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0341-flatten-nested-list-iterator/Medium | Stack, Tree, Depth-First Search, Design, Queue, Iteratorhttps://leetcode-solutions-5zk.pages.dev/posts/0404-sum-of-left-leaves/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0404-sum-of-left-leaves/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0429-n-ary-tree-level-order-traversal/Medium | Tree, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0437-path-sum-iii/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0437-path-sum-iii/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0449-serialize-and-deserialize-bst/Medium | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0450-delete-node-in-a-bst/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0450-delete-node-in-a-bst/Medium | Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0100-same-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0100-same-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0101-symmetric-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0101-symmetric-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0102-binary-tree-level-order-traversal/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0103-binary-tree-zigzag-level-order-traversal/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0104-maximum-depth-of-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0104-maximum-depth-of-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0105-construct-binary-tree-from-preorder-and-inorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0106-construct-binary-tree-from-inorder-and-postorder-traversal/Medium | Array, Hash Table, Divide and Conquer, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0107-binary-tree-level-order-traversal-ii/Medium | Tree, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0108-convert-sorted-array-to-binary-search-tree/Easy | Array, Divide and Conquer, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/Medium | Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0110-balanced-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0110-balanced-binary-tree/Easy | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0111-minimum-depth-of-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0111-minimum-depth-of-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0112-path-sum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0112-path-sum/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0113-path-sum-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0113-path-sum-ii/Medium | Backtracking, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/Medium | Linked List, Stack, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0124-binary-tree-maximum-path-sum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0124-binary-tree-maximum-path-sum/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0129-sum-root-to-leaf-numbers/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0129-sum-root-to-leaf-numbers/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0144-binary-tree-preorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0144-binary-tree-preorder-traversal/Easy | Stack, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0145-binary-tree-postorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0145-binary-tree-postorder-traversal/Easy | Stack, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0173-binary-search-tree-iterator/Medium | Stack, Tree, Design, Binary Search Tree, Binary Tree, Iteratorhttps://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/Easy | Binary Search, Bit Manipulation, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0226-invert-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0226-invert-binary-tree/Easy | Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0230-kth-smallest-element-in-a-bst/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0230-kth-smallest-element-in-a-bst/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0235-lowest-common-ancestor-of-a-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0235-lowest-common-ancestor-of-a-binary-search-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0236-lowest-common-ancestor-of-a-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0236-lowest-common-ancestor-of-a-binary-tree/Medium | Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0257-binary-tree-paths/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0257-binary-tree-paths/Easy | String, Backtracking, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Hard | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0094-binary-tree-inorder-traversal/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0094-binary-tree-inorder-traversal/Easy | Stack, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/Medium | Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/Medium | Math, Dynamic Programming, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0098-validate-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0098-validate-binary-search-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0099-recover-binary-search-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0099-recover-binary-search-tree/Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree