| 1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium |
| 1483 | Kth Ancestor of a Tree Node | Hard |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium |
| 1530 | Number of Good Leaf Nodes Pairs | Medium |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard |
| 1600 | Throne Inheritance | Medium |
| 1609 | Even Odd Tree | Medium |
| 1617 | Count Subtrees With Max Distance Between Cities | Hard |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard |
| 1766 | Tree of Coprimes | Hard |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard |
| 1932 | Merge BSTs to Create Single BST | Hard |
| 1993 | Operations on Tree | Medium |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Hard |
| 2049 | Count Nodes With the Highest Score | Medium |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium |
| 2196 | Create Binary Tree From Descriptions | Medium |
| 2236 | Root Equals Sum of Children | Easy |
| 2246 | Longest Path With Different Adjacent Characters | Hard |
| 2265 | Count Nodes Equal to Average of Subtree | Medium |
| 2322 | Minimum Score After Removals on a Tree | Hard |
| 2331 | Evaluate Boolean Binary Tree | Easy |
| 2368 | Reachable Nodes With Restrictions | Medium |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium |
| 2458 | Height of Binary Tree After Subtree Removal Queries | Hard |
| 2467 | Most Profitable Path in a Tree | Medium |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium |
| 2509 | Cycle Length Queries in a Tree | Hard |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard |
| 2581 | Count Number of Possible Root Nodes | Hard |