Create recursive.java

*****Recursive Solution*****

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
Create insertionSortList.Java

Sort a linked list using insertion sort. Time complexity O(n^2)
Merge pull request #1 from nickc181/codingquestions

Create recursive.java