| 61 |
Correct a Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 62 |
Count Complete Tree Nodes |
Easy |
Binary SearchBit ManipulationTree |
| 63 |
Count Good Nodes in Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 64 |
Count Nodes Equal to Average of Subtree |
Medium |
TreeDepth-First SearchBinary Tree |
| 65 |
Count Nodes Equal to Sum of Descendants |
Medium |
TreeDepth-First SearchBinary Tree |
| 66 |
Count Nodes That Are Great Enough |
Hard |
Divide and ConquerTreeDepth-First Search |
| 67 |
Count Nodes With the Highest Score |
Medium |
ArrayTreeDepth-First Search |
| 68 |
Count Number of Possible Root Nodes |
Hard |
ArrayHash TableDynamic Programming |
| 69 |
Count Pairs of Connectable Servers in a Weighted Tree Network |
Medium |
ArrayTreeDepth-First Search |
| 70 |
Count Paths That Can Form a Palindrome in a Tree |
Hard |
Dynamic ProgrammingBit ManipulationTree |
| 71 |
Count Subtrees With Max Distance Between Cities |
Hard |
Dynamic ProgrammingBit ManipulationTree |
| 72 |
Count the Number of Good Nodes |
Medium |
TreeDepth-First Search |
| 73 |
Count Univalue Subtrees |
Medium |
TreeDepth-First SearchBinary Tree |
| 74 |
Count Valid Paths in a Tree |
Hard |
MathDynamic ProgrammingTree |
| 75 |
Count Ways to Build Rooms in an Ant Colony |
Hard |
MathDynamic ProgrammingTree |