I'm dead.
I'm completely and utterly dead. I don't understand java, I don't understand data structures, I have to have everything in for my I by Friday, and I'm just as jammed and confused as I was last semester, and I just don't understand and I should have said something but I didn't and I'm dead and oh my god, I am having a hard time.
if there's any advice and/or help I could get about binary trees and how to understand them, and hash tables, and how to understand them, I might have a snowball's chance in a hothouse of pulling this off. But otherwise, I'm dead.
[Unless my teacher takes pity on me for people who keep *RUNNING* over my triggers.]
I'm completely and utterly dead. I don't understand java, I don't understand data structures, I have to have everything in for my I by Friday, and I'm just as jammed and confused as I was last semester, and I just don't understand and I should have said something but I didn't and I'm dead and oh my god, I am having a hard time.
if there's any advice and/or help I could get about binary trees and how to understand them, and hash tables, and how to understand them, I might have a snowball's chance in a hothouse of pulling this off. But otherwise, I'm dead.
[Unless my teacher takes pity on me for people who keep *RUNNING* over my triggers.]
no subject
Date: 2003-01-27 01:09 am (UTC)Start with a data structure that contains three elements: one is the data in the tree, and the other two are the pointers to the two children elements. you typically have a handful of pre-defined routines to create a node, traverse the nodes (recursively is best), delete a node, etc.
no subject
Date: 2003-01-27 01:49 am (UTC)Wish I could help...
Date: 2003-01-27 07:50 am (UTC)