Java trees

I am learning trees in my computer science class however I don't understand it much at all and can't find much about it. How can I tell if the tree is balanced, complete, full, and/or a binary search tree. Also the height, leaves and the number of internal nodes? I know its a lot but please help.

Here is the tree

Code:

---


            35
        /      \
      27          63
    /  \        /  \
  15    32      62    100
                /
              61

---

This is quite a broad question that you might be better off searching the net for solutions (to which there are many). For example: Binary Trees

This book can help you with it:
Discrete Mathematics with Applications
So its library, or whichever other ways you know of acquiring it.