some good practice questions
1.Generating binary numbers using recursion
2.Height of binary tree
3.count leaves in binary tree
4.mirroring tree
5.Minimum Depth of a Binary Tree
6.Determine if Two Trees are Identical
7.Deleting Nodes in a BST
8.count all the possible paths from top left to bottom right of a MxN matrix
9.[Gold mine problem](https://practice.geeksforgeeks.org/problems/gold-mine-problem/0)
10.Check if Tree is Isomorphic
11.Pascal's Triangle
1.Maximum subarray
2.Minimum length Unsorted Subarray (not O(N log N) solution)
3.Dutch national flag problem
4.Inversion of Array (Using Merge Sort)
5.Merge without extra space
6.0-1Knapsack Problem
7.Coin Change Problem
8.Pascals Triangle
9.Longest palindromic subsequence(The values are filled in a manner similar to Matrix Chain Multiplication)
10.Number of palindromic substring
11.Minimum insertions for generating palindrome
12.K-th Element of Two Sorted Arrays/(similar concept median of 2 sorted arrays)
13.Next smaller/next larger element
14.Tower of Hanoi recurrence relation
15.Cycle in a graph
16.Longest increasing subsequence
17.Count all submatrices with all ones
18.Reverse linked list/(in groups of k) //by changing pointers
19.Perfect Squares
20.Skip Tasks to Minimize Work