• 12 construct-binary-tree-from-ino
• 1 minimum-depth-of-binary-tree
• 2 binary-tree-postorder-traversa
• 3 binary-tree-preorder-traversal
• 4 sum-root-to-leaf-numbers
• 5 binary-tree-maximum-path-sum
• 6 populating-next-right-pointers
• 7 path-sum-ii
• 8 balanced-binary-tree
• 9 convert-sorted-list-to-binary-
• 10 convert-sorted-array-to-binary
• 11 binary-tree-level-order-traver
• 23 binary-tree-inorder-traversal
• 13 construct-binary-tree-from-pre
• 14 maximum-depth-of-binary-tree
• 15 binary-tree-zigzag-level-order
• 16 binary-tree-level-order-traver
• 17 symmetric-tree
• 18 same-tree
• 19 recover-binary-search-tree
• 20 validate-binary-search-tree
• 21 unique-binary-search-trees-ii
• 22 unique-binary-search-trees