-
Notifications
You must be signed in to change notification settings - Fork 0
Trees
Melike edited this page Jan 25, 2024
·
1 revision
Difficulty | Problem Number | Problem Title | Link |
---|---|---|---|
Easy | 226 | Invert Binary Tree | Link |
Easy | 104 | Maximum Depth of Binary Tree | Link |
Easy | 543 | Diameter of Binary Tree | Link |
Easy | 110 | Balanced Binary Tree | Link |
Easy | 100 | Same Tree | Link |
Easy | 572 | Subtree of Another Tree | Link |
Medium | 235 | Lowest Common Ancestor of a Binary Search Tree | Link |
Medium | 102 | Binary Tree Level Order Traversal | Link |
Medium | 199 | Binary Tree Right Side View | Link |
Medium | 1448 | Count Good Nodes in Binary Tree | Link |
Medium | 98 | Validate Binary Search Tree | Link |
Medium | 230 | Kth Smallest Element in a BST | Link |
Hard | 124 | Binary Tree Maximum Path Sum | Link |
Hard | 297 | Serialize and Deserialize Binary Tree | Link |