| 1 |
Add One Row to Tree |
AddOneRowToTree.java |
| 2 |
All Elements in Two Binary Search Trees |
AllElementsInTwoBinarySearchTrees.java |
| 3 |
All Nodes Distance K in Binary Tree |
AllNodesDistanceKinBinaryTree.java |
| 4 |
All Possible Full Binary Trees |
AllPossibleFullBinaryTrees.java |
| 5 |
Average of Levels in Binary Tree |
AverageOfLevelsInBinaryTree.java |
| 6 |
Balance a Binary Search Tree |
BalanceBinarySearchTree.java |
| 7 |
Balanced Binary Tree |
BalancedBinaryTree.java |
| 8 |
Binary Search Tree Iterator |
BinarySearchTreeIterator.java |
| 9 |
Binary Search Tree to Greater Sum Tree |
BinarySearchTreeToGreaterSumTree.java |
| 10 |
Binary Tree Coloring Game |
BinaryTreeColoringGame.java |
| 11 |
Binary Tree Inorder Traversal |
BinaryTreeInorderTraversal.java |
| 12 |
Binary Tree Level Order Traversal |
BinaryTreeLevelOrderTraversal.java |
| 13 |
Binary Tree Level Order Traversal II |
BinaryTreeLevelOrderTraversal2.java |
| 14 |
Binary Tree Maximum Path Sum |
BinaryTreeMaximumPathSum.java |
| 15 |
Binary Tree Paths |
BinaryTreePaths.java |
| 16 |
Binary Tree Postorder Traversal |
BinaryTreePostorderTraversal.java |
| 17 |
Binary Tree Preorder Traversal |
BinaryTreePreorderTraversal.java |
| 18 |
Binary Tree Pruning |
BinaryTreePruning.java |
| 19 |
Binary Tree Right Side View |
BinaryTreeRightSideView.java |
| 20 |
Binary Tree Tilt |
BinaryTreeTilt.java |
| 21 |
Binary Tree Zigzag Level Order Traversal |
BinaryTreeZigzagLevelOrderTraversal.java |
| 22 |
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
CheckIfStringIsValidSequenceFromRootToLeavesPath.java |
| 23 |
Construct Binary Search Tree from Preorder Traversal |
ConstructBinarySearchTreeFromPreorderTraversal.java |
| 24 |
Construct String from Binary Tree |
ConstructStringFromBinaryTree.java |
| 25 |
Convert BST to Greater Tree |
ConvertBSTToGreaterTree.java |
| 26 |
Convert Sorted Array to Binary Search Tree |
ConvertSortedArrayToBinarySearchTree.java |
| 27 |
Convert Sorted List to Binary Search Tree |
ConvertSortedListToBinarySearchTree.java |
| 28 |
Count Complete Tree Nodes |
CountCompleteTreeNodes.java |
| 29 |
Cousins in Binary Tree |
CousinsInBinaryTree.java |
| 30 |
Deepest Leaves Sum |
DeepestLeavesSum.java |
| 31 |
Delete Leaves With a Given Value |
DeleteLeavesWithGivenValue.java |
| 32 |
Delete Node in a BST |
DeleteNodeInBST.java |
| 33 |
Delete Nodes And Return Forest |
DeleteNodesAndReturnForest.java |
| 34 |
Diameter of Binary Tree |
DiameterOfBinaryTree.java |
| 35 |
Find Duplicate Subtrees |
FindDuplicateSubtrees.java |
| 36 |
Find Largest Value in Each Tree Row |
FindLargestValueInEachTreeRow.java |
| 37 |
Find Mode in Binary Search Tree |
FindModeInBinarySearchTree.java |
| 38 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
FindCorrespondingNodeOfBinaryTreeInCloneOfThatTree.java |
| 39 |
Flatten Binary Tree to Linked List |
FlattenBinaryTreeToLinkedList.java |
| 40 |
Increasing Order Search Tree |
IncreasingOrderSearchTree.java |
| 41 |
Insert into a Binary Search Tree |
InsertIntoBinarySearchTree.java |
| 42 |
Invert Binary Tree |
InvertBinaryTree.java |
| 43 |
Kth Smallest Element in a BST |
KthSmallestElementInBST.java |
| 44 |
Leaf-Similar Trees |
LeafSimilarTrees.java |
| 45 |
Lowest Common Ancestor of Deepest Leaves |
LowestCommonAncestorOfDeepestLeaves.java |
| 46 |
Lowest Common Ancestor of a Binary Search Tree |
LowestCommonAncestorOfBinarySearchTree.java |
| 47 |
Lowest Common Ancestor of a Binary Tree |
LowestCommonAncestorOfBinaryTree.java |
| 48 |
Lowest Common Ancestor of a Binary Tree |
LowestCommonAncestorOfBinaryTree.java |
| 49 |
Maximum Binary Tree |
MaximumBinaryTree.java |
| 50 |
Maximum Binary Tree II |
MaximumBinaryTree2.java |
| 51 |
Maximum Depth Of Binary Tree |
MaximumDepthOfBinaryTree.java |
| 52 |
Maximum Depth of N-ary Tree |
MaximumDepthOfNaryTree.java |
| 53 |
Maximum Difference Between Node and Ancestor |
MaximumDifferenceBetweenNodeAndAncestor.java |
| 54 |
Maximum Product of Splitted Binary Tree |
MaximumProductOfSplittedBinaryTree.java |
| 55 |
Maximum Sum BST in Binary Tree |
MaximumSumBSTinBinaryTree.java |
| 56 |
Merge Two Binary Trees |
MergeTwoBinaryTrees.java |
| 57 |
Minimum Absolute Difference in BST |
MinimumAbsoluteDifferenceInBST.java |
| 58 |
Minimum Depth of BinaryTree |
MinimumDepthOfBinaryTree.java |
| 59 |
Minimum Distance Between BST Nodes |
MinimumDistanceBetweenBSTNodes.java |
| 60 |
Most Frequent Subtree Sum |
MostFrequentSubtreeSum.java |
| 61 |
N-ary Tree Level Order Traversal |
NaryTreeLevelOrderTraversal.java |
| 62 |
N-ary Tree Postorder Traversal |
NaryTreePostorderTraversal.java |
| 63 |
N-ary Tree Preorder Traversal |
NaryTreePreorderTraversal.java |
| 64 |
Path Sum |
PathSum.java |
| 65 |
Path Sum II |
PathSum2.java |
| 66 |
Path Sum III |
PathSum3.java |
| 67 |
Populating Next Right Pointers in Each Node |
PopulatingNextRightPointersInEachNode2.java |
| 68 |
Populating Next Right Pointers in Each Node II |
PopulatingNextRightPointersInEachNode2.java |
| 69 |
Range Sum of BST |
RangeSumOfBST.java |
| 70 |
Recover Binary Search Tree |
RecoverBinarySearchTree.java |
| 71 |
Same Tree |
SameTree.java |
| 72 |
Search in a Binary Search Tree |
SearchBinarySearchTree.java |
| 73 |
Second Minimum Node In a Binary Tree |
SecondMinimumNodeInBinaryTree.java |
| 74 |
Serialize and Deserialize BST |
SerializeAndDeserializeBST.java |
| 75 |
Serialize and Deserialize Binary Tree |
SerializeAndDeserializeBinaryTree.java |
| 76 |
Smallest String Starting From Leaf |
SmallestStringStartingFromLeaf.java |
| 77 |
Smallest Subtree with all the Deepest Nodes |
SmallestSubtreeWithallTheDeepestNodes.java |
| 78 |
Subtree of Another Tree |
SubtreeOfAnotherTree.java |
| 79 |
Sum Root to Leaf Numbers |
SumRootToLeafNumbers.java |
| 80 |
Sum of Left Leaves |
SumOfLeftLeaves.java |
| 81 |
Sum of Root To Leaf Binary Numbers |
SumOfRootToLeafBinaryNumbers.java |
| 82 |
Symmetric Tree |
SymmetricTree.java |
| 83 |
Two Sum IV - Input is a BST |
TwoSum4InputBST.java |
| 84 |
Univalued Binary Tree |
UnivaluedBinaryTree.java |
| 85 |
Validate Binary Search Tree |
ValidateBinarySearchTree.java |
| 86 |
Vertical Order Traversal of a Binary Tree |
VerticalOrderTraversalOfBinaryTree.java |