|
Lowest common ancestor of a binary tree IV
tree
|
|
O(n) |
Aug 7, 2023 |
|
Univalued binary tree
tree
|
|
O(n) |
May 27, 2023 |
|
Kth largest sum in a binary tree
heap
tree
|
|
O(nlog(k)) |
May 21, 2023 |
|
Diameter of N-ary tree
tree
|
|
O(n) |
May 17, 2023 |
|
Number of good leaf nodes pairs
tree
|
|
O(n^2) |
May 17, 2023 |
|
Equal tree partition
tree
|
|
O(n) |
May 10, 2023 |
|
Increasing order search tree
tree
|
|
O(n) |
May 9, 2023 |
|
Number of good paths
tree
|
|
O(nlog(n)) |
Jan 15, 2023 |
|
Longest path with different adjacent characters
tree
|
|
O(n) |
Jan 13, 2023 |
|
Number of nodes in the sub tree with the same label
tree
|
|
O(n) |
Jan 12, 2023 |
|
Minimum time to collect all apples in a tree
tree
graph
|
|
O(n) |
Jan 11, 2023 |
|
Two sum bsts
tree
|
|
O(n) |
Jan 1, 2023 |
|
Create binary tree from descriptions
tree
|
|
O(n) |
Dec 31, 2022 |
|
Convert binary search tree to sorted doubly linked list
linked-list
tree
|
|
O(n) |
Dec 23, 2022 |
|
Flatten a multilevel doubly linked list
linked-list
tree
|
|
O(n) |
Dec 23, 2022 |
|
Sum of distances in tree
tree
|
|
O(n) |
Dec 22, 2022 |
|
Find distance in a binary tree
tree
|
|
O(n) |
Dec 21, 2022 |
|
Binary tree longest consecutive sequence
tree
|
|
O(n) |
Dec 19, 2022 |
|
Clone binary tree with random pointer
tree
|
|
O(n) |
Dec 19, 2022 |
|
Root equals sum of children
tree
|
|
O(1) |
Dec 17, 2022 |
|
Longest univalue path
tree
|
|
O(n) |
Dec 12, 2022 |
|
Lowest common ancestor of deepest leaves
tree
|
|
O(n) |
Dec 12, 2022 |
|
Maximum level sum of a binary tree
tree
|
|
O(n) |
Dec 12, 2022 |
|
Smallest subtree with all the deepest nodes
tree
|
|
O(n) |
Dec 12, 2022 |
|
Maximum product of splitted binary tree
tree
|
|
O(n) |
Dec 10, 2022 |
|
Find root of N-ary tree
tree
|
|
O(n) |
Dec 8, 2022 |
|
Range sum of bst
tree
|
|
O(n) |
Dec 7, 2022 |
|
largest-bst-subtree
tree
|
|
O(n^2) |
Dec 6, 2022 |
|
Path sum IV
tree
|
|
O(n) |
Dec 1, 2022 |
|
Count nodes equal to average of subtree
tree
|
|
O(n) |
Nov 30, 2022 |
|
Find leaves of binary tree
tree
|
|
O(n) |
Nov 30, 2022 |
|
Maximum average subtree
tree
|
|
O(n) |
Nov 30, 2022 |
|
Recover a tree from preorder traversal
tree
|
|
O(n) |
Nov 30, 2022 |
|
Verify preorder sequence in binary search tree
tree
|
|
— |
Nov 30, 2022 |
|
Count univalue subtrees
tree
|
|
O(n) |
Nov 29, 2022 |
|
Inorder successor in BST
tree
|
|
O(h) |
Nov 29, 2022 |
|
Binary tree vertical order traversal
tree
|
|
O(n) |
Nov 28, 2022 |
|
Count nodes equal to sum of descendants
tree
|
|
O(n) |
Nov 28, 2022 |
|
Validate binary tree nodes
tree
|
|
O(n) |
Nov 28, 2022 |
|
Binary tree upside down
tree
|
|
O(n) |
Nov 27, 2022 |
|
Linked list in binary tree
linked-list
tree
|
|
O(n) |
Nov 21, 2022 |
|
All nodes distance k in binary tree
tree
|
|
O(n) |
Nov 20, 2022 |
|
Symmetric tree
tree
|
|
O(n) |
Nov 17, 2022 |
|
Construct binary search tree from preorder traversal
tree
|
|
O(n) |
Nov 16, 2022 |
|
Delete nodes and return forest
tree
|
|
O(n) |
Nov 16, 2022 |
|
Insert into a binary search tree
tree
|
|
O(n) |
Nov 16, 2022 |
|
Path in zigzag labelled binary tree
tree
|
|
O(log(n)) |
Nov 16, 2022 |
|
Trim a binary search tree
tree
|
|
O(n) |
Nov 16, 2022 |
|
Binary tree tilt
tree
|
|
O(n) |
Nov 15, 2022 |
|
Find duplicate subtrees
tree
|
|
O(n) |
Nov 15, 2022 |
|
Find mode in binary search tree
tree
|
|
O(n) |
Nov 15, 2022 |
|
Maximum width of binary tree
tree
|
|
O(n) |
Nov 15, 2022 |
|
Most frequent subtree sum
tree
|
|
O(n) |
Nov 15, 2022 |
|
Path sum III
dynamic-programming
backtracking
tree
|
|
O(n) |
Nov 15, 2022 |
|
Leaf similar trees
tree
|
|
O(n+m) |
Nov 12, 2022 |
|
Check completeness of a binary tree
tree
|
|
O(n) |
Nov 6, 2022 |
|
Minimum absolute difference in bst
tree
|
|
O(n) |
Nov 1, 2022 |
|
Search in a binary search tree
tree
|
|
O(n) |
Oct 29, 2022 |
|
All elements in two binary search trees
tree
|
|
O(n1+n2) |
Oct 28, 2022 |
|
Reverse odd levels of binary tree
tree
|
|
O(n) |
Oct 25, 2022 |
|
Serialize and deserialize bst
tree
design
|
|
O(n) |
Oct 25, 2022 |
|
Delete leaves with a given value
tree
|
|
O(n) |
Oct 16, 2022 |
|
Convert bst to greater tree
tree
|
|
O(n) |
Oct 9, 2022 |
|
Find bottom left tree value
tree
|
|
O(n) |
Oct 9, 2022 |
|
Flip equivalent binary trees
tree
|
|
O(n) |
Oct 9, 2022 |
|
Two sum IV input is a bst
tree
|
|
O(n) |
Oct 9, 2022 |
|
Merge two binary trees
tree
|
|
O(n) |
Oct 6, 2022 |
|
Add one row to tree
tree
|
|
O(n) |
Oct 5, 2022 |
|
Deepest leaves sum
tree
|
|
O(n) |
Sep 17, 2022 |
|
Insufficient nodes in root to leaf paths
tree
|
|
O(n) |
Sep 14, 2022 |
|
Pseudo palindromic paths in a binary tree
backtracking
tree
|
|
O(n) |
Sep 14, 2022 |
|
Maximum difference between node and ancestor
tree
|
|
O(n) |
Sep 11, 2022 |
|
Maximum binary tree II
tree
|
|
O(n) |
Sep 10, 2022 |
|
Maximum binary tree
tree
|
|
O(n) |
Sep 10, 2022 |
|
Construct string from binary tree
tree
|
|
O(n) |
Sep 7, 2022 |
|
Print binary tree
tree
|
|
O(n) |
Sep 7, 2022 |
|
Binary tree pruning
tree
|
|
O(n) |
Sep 6, 2022 |
|
Amount of time for binary tree to be infected
tree
|
|
O(n) |
Sep 4, 2022 |
|
Binary search tree iterator
tree
|
|
O(n) |
Sep 4, 2022 |
|
Binary tree level order traversal II
tree
|
|
O(n) |
Sep 4, 2022 |
|
Binary tree zigzag level order traversal
tree
|
|
O(n) |
Sep 4, 2022 |
|
Construct binary tree from inorder and postorder traversal
tree
|
|
O(n) |
Sep 4, 2022 |
|
Convert sorted list to binary search tree
tree
|
|
O(n) |
Sep 4, 2022 |
|
Count complete tree nodes
tree
|
|
O(log(n)) |
Sep 4, 2022 |
|
delete-node-in-a-bst
tree
|
|
O(log(n)) |
Sep 4, 2022 |
|
Populating next right pointers in each node II
tree
|
|
O(n) |
Sep 4, 2022 |
|
Populating next right pointers in each node
tree
|
|
O(n) |
Sep 4, 2022 |
|
Recover binary search tree
tree
|
|
O(nlog(n)) |
Sep 4, 2022 |
|
Vertical order traversal of a binary tree
tree
|
|
O(n) |
Sep 4, 2022 |
|
Balance a binary search tree
tree
|
|
O(n) |
Sep 3, 2022 |
|
Average of levels in binary tree
tree
|
|
O(n) |
Sep 2, 2022 |
|
Sum root to leaf numbers
tree
|
|
O(n) |
Sep 2, 2022 |
|
N-ary tree level order traversal
tree
|
|
O(n) |
Sep 1, 2022 |
|
Construct binary tree from preorder and postorder traversal
tree
|
|
O(n) |
Aug 21, 2022 |
|
Cousins in binary tree
tree
|
|
O(n) |
Aug 21, 2022 |
|
Convert sorted array to binary search tree
tree
|
|
O(n) |
Aug 10, 2022 |
|
Binary tree maximum path sum
tree
|
|
O(n) |
Aug 6, 2022 |
|
Kth smallest element in a bst
tree
|
|
O(n) |
Aug 6, 2022 |
|
Serialize and deserialize binary tree
tree
design
|
|
O(n) |
Aug 6, 2022 |
|
Validate binary search tree
tree
|
|
O(n) |
Aug 6, 2022 |
|
My calendar I
tree
|
|
O(log(n)) |
Aug 3, 2022 |
|
Flatten binary tree to linked list
tree
|
|
O(n) |
Jul 27, 2022 |
|
Count good nodes in binary tree
tree
|
|
O(n) |
Jul 26, 2022 |
|
Lowest common ancestor of a binary tree
tree
|
|
O(n) |
Jul 26, 2022 |
|
Binary tree inorder traversal
tree
|
|
O(n) |
Jul 20, 2022 |
|
Binary tree postorder traversal
tree
|
|
O(n) |
Jul 20, 2022 |
|
Binary tree preorder traversal
tree
|
|
O(n) |
Jul 20, 2022 |
|
N-ary tree postorder traversal
tree
|
|
O(n) |
Jul 20, 2022 |
|
N-ary tree preorder traversal
tree
|
|
O(n) |
Jul 20, 2022 |
|
Path sum
tree
|
|
O(n) |
Jul 19, 2022 |
|
Find largest value in each tree row
tree
|
|
O(n) |
Jul 18, 2022 |
|
Lowest common ancestor of a binary search tree
tree
|
|
O(n) |
Jul 18, 2022 |
|
Balanced binary tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Construct binary tree from preorder and inorder traversal
tree
|
|
O(n) |
Jul 14, 2022 |
|
Diameter of binary tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Invert binary tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Maximum depth of binary tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Maximum depth of n-ary tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Same tree
tree
|
|
O(n) |
Jul 14, 2022 |
|
Subtree of another tree
tree
|
|
O(n^2) |
Jul 14, 2022 |
|
Binary tree level order traversal
tree
|
|
— |
Jul 13, 2022 |
|
Binary tree right side view
tree
|
|
O(n) |
Jul 11, 2022 |
