Moocable is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
Syllabus
- 1. Unique Binary Search Trees II
- 2. Unique Binary Search Trees
- 3. Validate Binary Search Tree
- 4. Recover Binary Search Tree
- 5. Same Tree
- 6. Symmetric Tree
- 7. Binary Tree Level Order Traversal
- 8. Binary Tree Zigzag Level Order Traversal
- 9. Maximum Depth of Binary Tree
- 10. Binary Tree Level Order Traversal II
- 11. Convert Sorted Array to Binary Search Tree
- 12. Convert Sorted List to Binary Search Tree
- 13. Minimum Depth of Binary Tree
- 14. Binary Tree Right Side View
- 15. Kth Smallest Element in a BST
- 16. Lowest Common Ancestor of a Binary Search Tree
- 17. Lowest Common Ancestor of a Binary Tree
- 18. Binary Tree Paths
- 19. Serialize and Deserialize Binary Tree
- 20. Verify Preorder Serialization of a Binary Tree
- 21. Sum of Left Leaves
- 22. Path Sum III
- 23. Serialize and Deserialize BST
- 24. Delete Node in a BST
- 25. Find Largest Value in Each Tree Row
- 26. Minimum Absolute Difference in BST
- 27. Convert BST to Greater Tree
- 28. Add One Row to Tree
- 29. Average of Levels in Binary Tree
- 30. Maximum Width of Binary Tree
- 31. Trim a Binary Search Tree
- 32. N-ary Tree Level Order Traversal
- 33. Maximum Depth of N-ary Tree
- 34. Search in a Binary Search Tree
- 35. Kth Largest Element in a Stream
- 36. Minimum Distance Between BST Nodes
- 37. Sum of Distances in Tree
- 38. All Nodes Distance K in Binary Tree
- 39. Smallest Subtree with all the Deepest Nodes
- 40. Leaf-Similar Trees
- 41. Construct Binary Tree from Preorder and Postorder Traversal
- 42. All Possible Full Binary Trees
- 43. Increasing Order Search Tree
- 44. Range Sum of BST
- 45. Flip Equivalent Binary Trees
- 46. Check Completeness of a Binary Tree
- 47. Univalued Binary Tree
- 48. Flip Binary Tree To Match Preorder Traversal
- 49. Smallest String Starting From Leaf
- 50. Cousins in Binary Tree
- 51. Construct Binary Search Tree from Preorder Traversal
- 52. Sum of Root To Leaf Binary Numbers
- 53. Maximum Difference Between Node and Ancestor
- 54. Recover a Tree From Preorder Traversal
- 55. Binary Search Tree to Greater Sum Tree
- 56. Maximum Level Sum of a Binary Tree
- 57. Insufficient Nodes in Root to Leaf Paths
- 58. Path In Zigzag Labelled Binary Tree
- 59. Delete Nodes And Return Forest
- 60. Lowest Common Ancestor of Deepest Leaves
- 61. Sum of Nodes with Even-Valued Grandparent
- 62. Deepest Leaves Sum
- 63. Validate Binary Tree Nodes
- 64. Kth Ancestor of a Tree Node
- 65. All Elements in Two Binary Search Trees
- 66. Delete Leaves With a Given Value
- 67. Frog Position After T Seconds
- 68. Count Good Nodes in Binary Tree
- 69. Pseudo-Palindromic Paths in a Binary Tree
- 70. Number of Nodes in the Sub-Tree With the Same Label
- 71. Number of Good Leaf Nodes Pairs
- 72. Even Odd Tree
- 73. Number Of Ways To Reconstruct A Tree
- 74. Merge BSTs to Create Single BST
Problem Set 
Free 
Intermediate 
No certificate 
-
TypeProblem Set
-
Provider
-
PricingFree
-
DifficultyIntermediate
-
CertificateNo certificate
- 1. Unique Binary Search Trees II
- 2. Unique Binary Search Trees
- 3. Validate Binary Search Tree
- 4. Recover Binary Search Tree
- 5. Same Tree
- 6. Symmetric Tree
- 7. Binary Tree Level Order Traversal
- 8. Binary Tree Zigzag Level Order Traversal
- 9. Maximum Depth of Binary Tree
- 10. Binary Tree Level Order Traversal II
- 11. Convert Sorted Array to Binary Search Tree
- 12. Convert Sorted List to Binary Search Tree
- 13. Minimum Depth of Binary Tree
- 14. Binary Tree Right Side View
- 15. Kth Smallest Element in a BST
- 16. Lowest Common Ancestor of a Binary Search Tree
- 17. Lowest Common Ancestor of a Binary Tree
- 18. Binary Tree Paths
- 19. Serialize and Deserialize Binary Tree
- 20. Verify Preorder Serialization of a Binary Tree
- 21. Sum of Left Leaves
- 22. Path Sum III
- 23. Serialize and Deserialize BST
- 24. Delete Node in a BST
- 25. Find Largest Value in Each Tree Row
- 26. Minimum Absolute Difference in BST
- 27. Convert BST to Greater Tree
- 28. Add One Row to Tree
- 29. Average of Levels in Binary Tree
- 30. Maximum Width of Binary Tree
- 31. Trim a Binary Search Tree
- 32. N-ary Tree Level Order Traversal
- 33. Maximum Depth of N-ary Tree
- 34. Search in a Binary Search Tree
- 35. Kth Largest Element in a Stream
- 36. Minimum Distance Between BST Nodes
- 37. Sum of Distances in Tree
- 38. All Nodes Distance K in Binary Tree
- 39. Smallest Subtree with all the Deepest Nodes
- 40. Leaf-Similar Trees
- 41. Construct Binary Tree from Preorder and Postorder Traversal
- 42. All Possible Full Binary Trees
- 43. Increasing Order Search Tree
- 44. Range Sum of BST
- 45. Flip Equivalent Binary Trees
- 46. Check Completeness of a Binary Tree
- 47. Univalued Binary Tree
- 48. Flip Binary Tree To Match Preorder Traversal
- 49. Smallest String Starting From Leaf
- 50. Cousins in Binary Tree
- 51. Construct Binary Search Tree from Preorder Traversal
- 52. Sum of Root To Leaf Binary Numbers
- 53. Maximum Difference Between Node and Ancestor
- 54. Recover a Tree From Preorder Traversal
- 55. Binary Search Tree to Greater Sum Tree
- 56. Maximum Level Sum of a Binary Tree
- 57. Insufficient Nodes in Root to Leaf Paths
- 58. Path In Zigzag Labelled Binary Tree
- 59. Delete Nodes And Return Forest
- 60. Lowest Common Ancestor of Deepest Leaves
- 61. Sum of Nodes with Even-Valued Grandparent
- 62. Deepest Leaves Sum
- 63. Validate Binary Tree Nodes
- 64. Kth Ancestor of a Tree Node
- 65. All Elements in Two Binary Search Trees
- 66. Delete Leaves With a Given Value
- 67. Frog Position After T Seconds
- 68. Count Good Nodes in Binary Tree
- 69. Pseudo-Palindromic Paths in a Binary Tree
- 70. Number of Nodes in the Sub-Tree With the Same Label
- 71. Number of Good Leaf Nodes Pairs
- 72. Even Odd Tree
- 73. Number Of Ways To Reconstruct A Tree
- 74. Merge BSTs to Create Single BST
Loading...
Saving...
Loading...