| 700 | Search in a Binary Search Tree | Easy |
| 701 | Insert into a Binary Search Tree | Medium |
| 703 | Kth Largest Element in a Stream | Easy |
| 783 | Minimum Distance Between BST Nodes | Easy |
| 814 | Binary Tree Pruning | Medium |
| 863 | All Nodes Distance K in Binary Tree | Medium |
| 865 | Smallest Subtree with all the Deepest Nodes | Medium |
| 872 | Leaf-Similar Trees | Easy |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium |
| 894 | All Possible Full Binary Trees | Medium |
| 897 | Increasing Order Search Tree | Easy |
| 919 | Complete Binary Tree Inserter | Medium |
| 938 | Range Sum of BST | Easy |
| 951 | Flip Equivalent Binary Trees | Medium |
| 958 | Check Completeness of a Binary Tree | Medium |
| 965 | Univalued Binary Tree | Easy |
| 968 | Binary Tree Cameras | Hard |
| 971 | Flip Binary Tree To Match Preorder Traversal | Medium |
| 979 | Distribute Coins in Binary Tree | Medium |
| 987 | Vertical Order Traversal of a Binary Tree | Hard |
| 988 | Smallest String Starting From Leaf | Medium |
| 993 | Cousins in Binary Tree | Easy |
| 998 | Maximum Binary Tree II | Medium |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy |
| 1026 | Maximum Difference Between Node and Ancestor | Medium |
| 1028 | Recover a Tree From Preorder Traversal | Hard |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | Medium |
| 1104 | Path In Zigzag Labelled Binary Tree | Medium |