Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adding leetcode links to binary tree traversal problems #11

Open
wants to merge 7 commits into
base: master
Choose a base branch
from
+9 −9
Open

Adding leetcode links to binary tree traversal problems #11

Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
4d6fc3c
Update readme.md
aiswaryasukumar4 Apr 16, 2022
1ea0687
Update readme.md
aiswaryasukumar4 Apr 16, 2022
5453a65
Update readme.md
aiswaryasukumar4 Apr 16, 2022
33966c1
Correct leetcode link
aiswaryasukumar4 Apr 16, 2022
2878d73
Update readme.md
aiswaryasukumar4 Apr 17, 2022
01c34f2
Correct wrong serial number
aiswaryasukumar4 Apr 17, 2022
faf2064
Add leetcode link for Coin Sum Infinite
aiswaryasukumar4 Apr 17, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 9 additions & 9 deletions readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -82,22 +82,22 @@ I have tried my best to sort all those problems for you and ordered them as well
| **ID** | **PROBLEM STATEMENT** | **PROBLEM LINK** |
|--------|---------------------------------------------------------|--------------------------------|
| 1 | Determine Height of a binary tree | [LeetCode](https://leetcode.com/problems/maximum-depth-of-binary-tree/) , [InterviewBit](https://www.interviewbit.com/problems/max-depth-of-binary-tree/) |
| 2 | Inorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/inorder-traversal/) |
| 3 | Preorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/preorder-traversal/) |
| 4 | Postorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/postorder-traversal/) |
| 2 | Inorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/inorder-traversal/) , [LeetCode](https://leetcode.com/problems/binary-tree-inorder-traversal/) |
| 3 | Preorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/preorder-traversal/) , [LeetCode](https://leetcode.com/problems/binary-tree-preorder-traversal/) |
| 4 | Postorder Traversal | [InterviewBit](https://www.interviewbit.com/problems/postorder-traversal/) , [LeetCode](https://leetcode.com/problems/binary-tree-postorder-traversal/) |
| 5 | Level Order Traversal | [LeetCode](https://leetcode.com/problems/binary-tree-level-order-traversal/) |
| 6 | Level Order Traversal in Spiral Form | [LeetCode](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) , [InterviewBit](https://www.interviewbit.com/problems/zigzag-level-order-traversal-bt/) |
| 7 | Left and Right View of Binary Tree | [LeetCode](https://leetcode.com/problems/binary-tree-right-side-view/) |
| 8 | Diameter of a Binary tree | [LeetCode](https://leetcode.com/problems/diameter-of-binary-tree/) |
| 9 | Populating Next Right Pointers in Each Node | [LeetCode](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) , [InterviewBit](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) |
| 10 | Check if a Binary Tree is Sum Tree | [GFG](https://practice.geeksforgeeks.org/problems/sum-tree/1) |
| 11 | Check if a Binary Tree is Balanced | [LeetCode](https://leetcode.com/problems/balanced-binary-tree/) , [InterviewBit](https://leetcode.com/problems/balanced-binary-tree/) |
| 12 | Check if a Binary Tree is BST | [GFG](https://practice.geeksforgeeks.org/problems/check-for-bst/1) |
| 12 | Check if a Binary Tree is BST | [GFG](https://practice.geeksforgeeks.org/problems/check-for-bst/1), [LeetCode](https://leetcode.com/problems/validate-binary-search-tree/) |
| 13 | Convert a given Binary Tree into its mirror Tree | [GFG](https://practice.geeksforgeeks.org/problems/mirror-tree/1) |
| 14 | Check if two Binary Tree are mirror image of each other | [GFG](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0) |
| 15 | Check if a Binary Tree is Symmetric Binary Tree | [InterviewBit](https://www.interviewbit.com/problems/symmetric-binary-tree/) , [LeetCode](https://leetcode.com/problems/symmetric-tree/) |
| 16 | Invert a Binary Tree | [InterviewBit](https://www.interviewbit.com/problems/invert-the-binary-tree/) , [LeetCode](https://leetcode.com/problems/invert-binary-tree/) |
| 17 | Vertical order Traversal | [InterviewBit](https://www.interviewbit.com/problems/vertical-order-traversal-of-binary-tree/) |
| 17 | Vertical order Traversal | [InterviewBit](https://www.interviewbit.com/problems/vertical-order-traversal-of-binary-tree/), [LeetCode](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) |
| 18 | Top View Of Binary Tree | [GFG](https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1) |
| 19 | Bottom View of Binary Tree | [GFG](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1) |
| 20 | Check if Root to Leaf path sum exist | [InterviewBit](https://www.interviewbit.com/problems/path-sum/) , [LeetCode](https://leetcode.com/problems/path-sum/) |
Expand All @@ -113,13 +113,13 @@ I have tried my best to sort all those problems for you and ordered them as well
| 1 | Insert a Node in BST | [LeetCode](https://leetcode.com/problems/insert-into-a-binary-search-tree/) |
| 2 | Delete a Node from BST | [LeetCode](https://leetcode.com/problems/delete-node-in-a-bst/) |
| 3 | Lowest common ancestor in BST | [LeetCode](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) |
| 4 | Inorder Successor in BST | [LeetCode](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1) |
| 4 | Inorder Successor in BST | [LeetCode](https://leetcode.com/problems/inorder-successor-in-bst/), [GFG](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1) |
| 5 | Kth Smallest node in BST | [LeetCode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |

### Heap and Priority Queue
| **ID** | **PROBLEM STATEMENT** | **PROBLEM LINK** |
|--------|------------------------------------------|-----------------------------------------------|
| 1 | Median in a stream of integers | [GFG](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0) |
| 1 | Median in a stream of integers | [GFG](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0), [LeetCode](https://leetcode.com/problems/find-median-from-data-stream/) |
| 2 | Top K Frequent Elements in an Array | [LeetCode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 3 | Kth Largest Element in a Stream | [LeetCode](https://leetcode.com/problems/kth-largest-element-in-a-stream/) |
| 4 | Sort a nearly sorted (or K sorted) array | [GFG](https://www.geeksforgeeks.org/nearly-sorted-algorithm/) |
Expand All @@ -138,14 +138,14 @@ I have tried my best to sort all those problems for you and ordered them as well
| 4 | Pow(x,n) | [LeetCode](https://leetcode.com/problems/powx-n/) , [InterviewBit](https://www.interviewbit.com/problems/implement-power-function/) |
| 5 | Sqrt(n) | [LeetCode](https://leetcode.com/problems/sqrtx/) , [InterviewBit](https://www.interviewbit.com/problems/square-root-of-integer/) |
| 6 | Matrix Search | [LeetCode](https://leetcode.com/problems/search-a-2d-matrix/) , [InterviewBit](https://www.interviewbit.com/problems/matrix-search/) |
| 6 | Median of Two Sorted Arrays | [LeetCode](https://leetcode.com/problems/median-of-two-sorted-arrays/) , [InterviewBit](https://www.interviewbit.com/problems/median-of-array/) |
| 7 | Median of Two Sorted Arrays | [LeetCode](https://leetcode.com/problems/median-of-two-sorted-arrays/) , [InterviewBit](https://www.interviewbit.com/problems/median-of-array/) |


## Dynamic Programming
| **ID** | **PROBLEM STATEMENT** | **PROBLEM LINK** |
|--------|------------------------------------------------------|-----------------------------------------|
| 1 | Climbing Stairs | [LeetCode](https://leetcode.com/problems/climbing-stairs/) |
| 2 | Coin Sum Infinite | [InterviewBit](https://www.interviewbit.com/problems/coin-sum-infinite/) |
| 2 | Coin Sum Infinite | [InterviewBit](https://www.interviewbit.com/problems/coin-sum-infinite/), [LeetCode](https://leetcode.com/problems/coin-change/) |
| 3 | Min Cost Climbing Stairs | [LeetCode](https://leetcode.com/problems/min-cost-climbing-stairs/) |
| 4 | Rod Cutting Problem | [GFG](https://www.geeksforgeeks.org/cutting-a-rod-dp-13/) |
| 5 | Longest Common Subsequence | [LeetCode](https://leetcode.com/problems/delete-operation-for-two-strings/) |
Expand Down