| 94 | Binary Tree Inorder Traversal | Medium | tree |
| 99 | Recover Binary Search Tree | Hard | tree |
| 144 | Binary Tree Preorder Traversal | Medium | tree |
| 145 | Binary Tree Postorder Traversal | Hard | tree |
| 220 | Contains Duplicate III | Medium | binary search tree |
| 226 | Invert Binary Tree | Easy | tree |
| 230 | Kth Smallest Element in a BST | Medium | binary search tree |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Easy | binary search tree |
| 270 | Closest Binary Search Tree Value | Easy | binary search tree |
| 285 | Inorder Successor in BST | Medium | binary search tree |
| 352 | Data Stream as Disjoint Intervals | Hard | binary search tree |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | tree |
| 427 | Construct Quad Tree | Medium | tree |
| 428 | Serialize and Deserialize N-ary Tree | Hard | tree |
| 429 | N-ary Tree Level Order Traversal | Medium | tree |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | tree |
| 431 | Encode N-ary Tree to Binary Tree | Hard | tree |
| 449 | Serialize and Deserialize BST | Medium | binary search tree |
| 450 | Delete Node in a BST | Medium | binary search tree |
| 510 | Inorder Successor in BST II | Medium | binary search tree |
| 529 | Minesweeper | Medium | tree |
| 530 | Minimum Absolute Difference in BST | Easy | binary search tree |
| 536 | Construct Binary Tree from String | Medium | tree |
| 538 | Convert BST to Greater Tree | Easy | tree |
| 543 | Diameter of Binary Tree | Easy | tree |
| 545 | Boundary of Binary Tree | Medium | tree |
| 548 | Split Array with Equal Sum | Medium | tree |
| 563 | Binary Tree Tilt | Easy | tree |
| 572 | Subtree of Another Tree | Easy | tree |
| 606 | Construct String from Binary Tree | Easy | tree |
| 617 | Merge Two Binary Trees | Easy | tree |
| 623 | Add One Row to Tree | Medium | tree |
| 637 | Average of Levels in Binary Tree | Easy | tree |
| 655 | Print Binary Tree | Medium | tree |
| 663 | Equal Tree Partition | Medium | tree |
| 687 | Longest Univalue Path | Easy | tree |
| 776 | Split BST | Medium | binary search tree |
| 783 | Minimum Distance Between BST Nodes | Easy | binary search tree |
| 863 | All Nodes Distance K in Binary Tree | Medium | tree |
| 919 | Complete Binary Tree Inserter | Medium | tree |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | tree |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | tree |
| 1104 | Path In Zigzag Labelled Binary Tree | Easy | tree |
| 1257 | Smallest Common Region | Medium | tree |
| 1666 | Change the Root of a Binary Tree | Medium | tree |
| 1834 | Single-Threaded CPU | Medium | tree |
| 2196 | Create Binary Tree From Descriptions | Medium | tree |
| 2689 | Extract Kth Character From The Rope Tree | Medium | binary search tree |
| 3526 | Range XOR Queries with Subarray Reversals | Hard | binary search tree |