19 lessons · DSA pattern
Trees
A tree is recursive: every node is the root of a smaller tree. Already yours: recursion and trusting the smaller call ( Recursion ); deque with popleft() (…
- Trees — Overview→
- LC-104. Maximum Depth of Binary Tree→
- LC-226. Invert Binary Tree→
- LC-100. Same Tree→
- LC-572. Subtree of Another Tree→
- LC-543. Diameter of Binary Tree→
- LC-110. Balanced Binary Tree→
- LC-236. Lowest Common Ancestor of a Binary Tree→
- LC-102. Binary Tree Level Order Traversal→
- LC-199. Binary Tree Right Side View→
- LC-1448. Count Good Nodes in Binary Tree→
- LC-98. Validate Binary Search Tree→
- LC-230. Kth Smallest Element in a BST→
- LC-124. Binary Tree Maximum Path Sum→
- LC-297. Serialize and Deserialize Binary Tree→
- LC-105. Construct Binary Tree from Preorder and Inorder→
- LC-106. Construct Binary Tree from Inorder and Postorder→
- LC-987. Vertical Order Traversal of a Binary Tree→
- Trees Review→