I am having a real problem implementing a Binary search/AVL tree.
The search tree should contain details of known criminals. The criminal object which i have coded is below
I have attempted to piece together an attempt at implementing an AVL/tree from what i have read in my notes and from the internet.
Any advice as to where i am going wrong will be appreaciated. If i have broke any rules please inform me and i will take it down. I feel stupid for asking as i know it is something quite simple which i have over looked