Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.
Tag Archive
Easy
Binary Tree Level Order Traversal
Level Order Traversal
Binary Tree Postorder Traversal
Postorder Traversal
Binary Tree Inorder Traversal
Inorder Traversal
Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys gr...
Binary Tree Preorder Traversal
Preorder Traversal
Binary Tree Longest Consecutive Sequence
Given a binary tree, find the length of the longest consecutive sequence path.
Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.
Lowest Common Ancestor II
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.
Same Tree
Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value.
Flatten Binary Tree to Linked List
Flatten a binary tree to a fake “linked list” in pre-order traversal.
Binary Tree Path Sum
Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target.
Clone Binary Tree
For the given binary tree, return a deep copy of it.
Convert Binary Tree to Linked Lists by Depth
Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth.
Insert Five
Given a number, insert a 5 at any position of the number to make the number after insertion the largest
Binary Tree Postorder Traversal-null
Given a binary tree, return the postorder traversal of its nodes’ values. (Iteratively)
Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary search tree with minimal height.
Invert Binary Tree
Invert a binary tree. Left and right subtrees exchange.
Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.
N-ary Tree Preorder Traversal
Given an n-ary tree, return the preorder traversal of its nodes’ values.
Leaf-Similar Trees
Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.
Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.
Binary Tree Tilt
Given a binary tree, return the tilt of the whole tree.
Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s.
Average of Levels in Binary Tree
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
Maximum Binary Tree
Construct the maximum tree by the given array and return the root node of this tree.
Second Minimum Node In a Binary Tree
Output the second minimum value in the set made of all the nodes’ value in the whole tree.
Minimum Difference Between BST Nodes
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.
Binary Tree Pruning
Return this tree where every subtree (of the given tree) not containing a 1 has been removed.
Contains Duplicate
Question
Single Number
Question
Rotate Array
Question
Best Time to Buy and Sell Stock
Question
Remove Duplicates from Sorted Array
Question
Row & Column Swap Template
Row_Column_Swap_Template
Get Top N
How To Get Top N Diff Between Rank, Dense_Rank, and Row_Number
House Robber
Rob the most amount of money.
Two Sum
Return indices of the two numbers such that they add up to a specific target. Question
Medium
House Robber III
Rob the most amount of money.
House Robber II
Rob the most amount of money.
Reverse Linked List
Reverse a singly linked list.
Add Two Numbers
Add the two numbers and return it as a linked list. Question