Hi I need some help UNDERSTANDING BINARY TREE.
My professor want us to know how to
Delete a node from the binary tree
Determine the height of a node ( This is the longest path from the note to the root)
I’m really confuse with this topic so I don’t want the code to be complicated also I need a lot of comment to understand this.
I have a quiz at 8am Monday 17th 2003.
I will include the java file he gave us to work with.
PLEASE KEEP IT SIMPLE.
AND ALSO NO PROTECTED ACCESS TYPE
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
windows pro 2000