binary search tree

It's a binary tree. I would be inclined to indicate whether the tree can be USED for searching or not. To use a tree for searching (efficiently) the tree must be ordered. That requires that all nodes to the right of any particular node be "greater" and all nodes to the left be "lesser" than the that node (where greater and lesser could be defined in various ways, in the general case, depending on the data that is being used).
This tree fails that criterion in that 65 is to the right of 70, as is 80. One is less, the other is more, so the tree is not in order.
If it is in order, then when you are searching for a particular node, you can easily determine which node to inspect next, depending on whether the node you want is greater or lesser than the one you are currently considering.

The height would appear to be 4.

i agree with you that this is not a binary search tree but when i state the level of every node and height is this 1,2,3,3,4,4,4,4; 4 or is it 0,1,2,2,3,3,3,3; 4?

looks like homework questions to me...

all your questions are so simple and academic in nature: you should read your C++ and Data structures books more carefully. all those answers can be found in any beginners' books about these subjects...

comment about these being homework questions...i am 30 and by far not in school, but do take that as a compliment! im self teaching myself the C language as to one day be able to write programs for the business i own. these questions are exercises out of a book and sometimes i need assistance in how the answer is achieved for my own knowledge.