0329 Longest Increasing Path in a Matrix Go 44.5% Hard 0330 Patching Array 34.9% Hard 0331 Verify Preorder Serialization of a Binary Tree Go 40.9% Medium 0332 Reconstruct Itinerary 37.7% Medium 0333 Largest BST Subtree 37.5% Medium 0334 Increasing Triplet Subsequence 40.6% Medium 0335 Se...
time complexity: O(n) space complexity: best: O(1), worst: O(n/2)=O(n) DFS notes: time complexity: O(n) space complexity: best: O(log n) - avg. height of tree worst: O(n) inorder (DFS: left, self, right) postorder (DFS: left, right, self) preorder (DFS: self, left...
wherein a first parameter of the first parameter pair is set to a preorder of the first node, a first parameter of the second parameter pair is set to the adjusted post order of the first node and the second parameter of the first parameter pair and the second parameter of the second ...
0105 Construct Binary Tree from Preorder and Inorder Traversal Go 60.6% Medium 0106 Construct Binary Tree from Inorder and Postorder Traversal Go 57.3% Medium 0107 Binary Tree Level Order Traversal II Go 60.2% Medium 0108 Convert Sorted Array to Binary Search Tree Go 68.9% Easy 0109 Conv...