湛蓝与蔚蓝
Tree
标题
列 1
列 2
列 3
列 4
列 5
列 6
列 7
#
Title
Solution
Time
Space
Difficulty
Tag
Note
0094
Binary Tree Inorder Traversal
C++ Python
O(n)
O(1)
Medium
Morris Traversal
0099
Recover Binary Search Tree
C++ Python
O(n)
O(1)
Hard
Morris Traversal
0144
Binary Tree Preorder Traversal
C++ Python
O(n)
O(1)
Medium
Morris Traversal
0145
Binary Tree Postorder Traversal
C++ Python
O(n)
O(1)
Hard
Morris Traversal
0208
Implement Trie (Prefix Tree)
C++ Python
O(n)
O(1)
Medium
Trie
0211
Add and Search Word - Data structure design
C++ Python
O(min(n, h))
O(min(n, h))
Medium
Trie, DFS
0226
Invert Binary Tree
C++ Python
O(n)
O(h), O(w)
Easy
0297
Serialize and Deserialize Binary Tree
C++ Python
O(n)
O(h)
Hard
LintCode
DFS
0307
Range Sum Query - Mutable
C++ Python
ctor: O(n), update: O(logn), query: O(logn)
O(n)
Medium
LintCode
DFS, Segment Tree, BIT, Fenwick Tree
0308
Range Sum Query 2D - Mutable
C++ Python
ctor: O(m * n), update: O(logm * logn), query: O(logm * logn)
O(m * n)
Hard
🔒
DFS, Quad Tree, 2D BIT, 2D Fenwick Tree
0315
Count of Smaller Numbers After Self
C++ Python
O(nlogn)
O(n)
Hard
LintCode
BST, BIT, Fenwick Tree, Divide and Conquer, Merge Sort
0426
Convert Binary Search Tree to Sorted Doubly Linked List
C++ Python
O(n)
O(h)
Medium
🔒
0427
Construct Quad Tree
C++ Python
O(n)
O(h)
Medium
0428
Serialize and Deserialize N-ary Tree
C++ Python
O(n)
O(h)
Hard
🔒
0429
N-ary Tree Level Order Traversal
C++ Python
O(n)
O(w)
Medium
0430
Flatten a Multilevel Doubly Linked List
C++ Python
O(n)
O(1)
Medium
0431
Encode N-ary Tree to Binary Tree
C++ Python
O(n)
O(h)
Hard
🔒
0501
Find Mode in Binary Search Tree
C++ Python
O(n)
O(1)
Easy
Tree, Inorder Traversal
0508
Most Frequent Subtree Sum
C++ Python
O(n)
O(n)
Medium
Tree, DFS, Hash
0513
Find Bottom Left Tree Value
C++ Python
O(n)
O(h)
Medium
Tree, DFS, BFS
0525
Contiguous Array
C++ Python
O(n)
O(n)
Medium
0529
Minesweeper
C++ Python
O(m * n)
O(m + n)
Medium
0536
Construct Binary Tree from String
C++ Python
O(n)
O(h)
Medium
🔒
0538
Convert BST to Greater Tree
C++ Python
O(n)
O(h)
Easy
0543
Diameter of Binary Tree
C++ Python
O(n)
O(h)
Easy
0545
Boundary of Binary Tree
C++ Python
O(n)
O(h)
Medium
🔒
0548
Split Array with Equal Sum
C++ Python
O(n^2)
O(n)
Medium
🔒
0558
Logical OR of Two Binary Grids Represented as Quad-Trees
C++ Python
O(n)
O(h)
Medium
Tree, Divide and Conquer
0559
Max Consecutive Ones
C++ Python
O(n)
O(h)
Easy
Tree, DFS
0563
Binary Tree Tilt
C++ Python
O(n)
O(n)
Easy
0572
Subtree of Another Tree
C++ Python
O(m * n)
O(h)
Easy
0589
N-ary Tree Preorder Traversal
C++ Python
O(n)
O(h)
Easy
Tree, Preorder Traversal
0590
N-ary Tree Postorder Traversal
C++ Python
O(n)
O(h)
Medium
Tree, Preorder Traversal
0606
Construct String from Binary Tree
C++ Python
O(n)
O(h)
Easy
0617
Merge Two Binary Trees
C++ Python
O(n)
O(h)
Easy
0623
Add One Row to Tree
C++ Python
O(n)
O(h)
Medium
0637
Average of Levels in Binary Tree
C++ Python
O(n)
O(h)
Easy
0652
Find Duplicate Subtrees
C++ Python
O(n)
O(n)
Medium
DFS, Hash
0653
Two Sum IV - Input is a BST
C++ Python
O(n)
O(h)
Easy
Two Pointers
0654
Maximum Binary Tree
C++ Python
O(n)
O(n)
Medium
LintCode
Mono Stack, Cartesian Tree
0655
Print Binary Tree
C++ Python
O(n)
O(h)
Medium
0662
Maximum Width of Binary Tree
C++ Python
O(n)
O(h)
Medium
DFS
0663
Equal Tree Partition
C++ Python
O(n)
O(n)
Medium
🔒
Hash
0677
Map Sum Pairs
C++ Python
O(n)
O(t)
Medium
Trie
0684
Redundant Connection
C++ Python
O(n)
O(n)
Medium
Union Find
0685
Redundant Connection II
C++ Python
O(n)
O(n)
Hard
Union Find
0687
Longest Univalue Path
C++ Python
O(n)
O(h)
Easy
0699
Falling Squares
C++ Python
O(nlogn)
O(n)
Hard
Segment Tree
0700
Search in a Binary Search Tree
C++ Python
O(h)
O(1)
Easy
Tree
0701
Insert into a Binary Search Tree
C++ Python
O(h)
O(1)
Medium
Tree
0814
Binary Tree Pruning
C++ Python
O(n)
O(h)
Medium
DFS
0850
Rectangle Area II
C++ Python
O(nlogn)
O(n)
Hard
Segment Tree
0863
All Nodes Distance K in Binary Tree
C++ Python
O(n)
O(n)
Medium
DFS + BFS
0865
Smallest Subtree with all the Deepest Nodes
C++ Python
O(n)
O(h)
Medium
DFS
0889
Construct Binary Tree from Preorder and Postorder Traversal
C++ Python
O(n)
O(h)
Medium
DFS, Stack
0897
Increasing Order Search Tree
C++ Python
O(n)
O(h)
Easy
DFS
0919
Complete Binary Tree Inserter
C++ Python
ctor: O(n) insert: O(1) get_root: O(1)
O(n)
Medium
0938
Range Sum of BST
C++ Python
O(n)
O(h)
Medium
DFS
0951
Flip Equivalent Binary Trees
C++ Python
O(n)
O(h)
Medium
DFS
0958
Check Completeness of a Binary Tree
C++ Python
O(n)
O(w)
Medium
BFS
0965
Univalued Binary Tree
C++ Python
O(n)
O(h)
Easy
DFS
0971
Flip Binary Tree To Match Preorder Traversal
C++ Python
O(n)
O(h)
Medium
DFS
0979
Distribute Coins in Binary Tree
C++ Python
O(n)
O(h)
Medium
DFS
0987
Vertical Order Traversal of a Binary Tree
C++ Python
O(nlogn)
O(n)
Medium
DFS
0988
Smallest String Starting From Leaf
C++ Python
O(n + l * h)
O(h)
Medium
DFS
0993
Cousins in Binary Tree
C++ Python
O(n)
O(h)
Easy
DFS
0998
Maximum Binary Tree II
C++ Python
O(h)
O(1)
Medium
Cartesian Tree
Loading...
ran2323
ran2323
把我吹到那末日夹缝
Latest posts
Gemini Fullstack LangGraph Quickstart 总结 - 支持搜索 + reflect 的agent模板
Gemini Fullstack LangGraph Quickstart 总结 - 支持搜索 + reflect 的agent模板
2025-6-17
mcp 记录(1)
mcp 记录(1)
2025-4-20
SFT + DPO 塔罗解读
SFT + DPO 塔罗解读
2025-4-14
Backtracking
Backtracking
2025-4-14
Leetcode 0001-1000 分组
Leetcode 0001-1000 分组
2025-4-14
DPO 相关
DPO 相关
2025-3-29
Announcement
 
 
 
 
暂时没有新的内容