How would I check if a binary search tree is full or not recursively?? ?

By full you mean perfect binary treee?

How many nodes are in a perfect binary tree of height "h"?
http://en.wikipedia.org/wiki/Binary_tree#Properties_of_binary_trees

Use a depth first search algorithm to determine this
http://en.wikipedia.org/wiki/Tree_traversal#Depth-first