| 46 |
Construct String from Binary Tree |
Medium |
StringTreeDepth-First Search |
| 47 |
Convert Binary Search Tree to Sorted Doubly Linked List |
Medium |
Linked ListStackTree |
| 48 |
Convert BST to Greater Tree |
Medium |
TreeDepth-First SearchBinary Search Tree |
| 49 |
Convert Sorted Array to Binary Search Tree |
Easy |
ArrayDivide and ConquerTree |
| 50 |
Convert Sorted List to Binary Search Tree |
Medium |
Linked ListDivide and ConquerTree |
| 51 |
Correct a Binary Tree |
Medium |
Hash TableTreeDepth-First Search |
| 52 |
Count Complete Tree Nodes |
Easy |
Binary SearchBit ManipulationTree |
| 53 |
Count Good Nodes in Binary Tree |
Medium |
TreeDepth-First SearchBreadth-First Search |
| 54 |
Count Nodes Equal to Average of Subtree |
Medium |
TreeDepth-First SearchBinary Tree |
| 55 |
Count Nodes Equal to Sum of Descendants |
Medium |
TreeDepth-First SearchBinary Tree |
| 56 |
Count Nodes That Are Great Enough |
Hard |
Divide and ConquerTreeDepth-First Search |
| 57 |
Count Nodes With the Highest Score |
Medium |
ArrayTreeDepth-First Search |
| 58 |
Count Univalue Subtrees |
Medium |
TreeDepth-First SearchBinary Tree |
| 59 |
Cousins in Binary Tree |
Easy |
TreeDepth-First SearchBreadth-First Search |
| 60 |
Cousins in Binary Tree II |
Medium |
Hash TableTreeDepth-First Search |