Tree and best-first search basic theory?

[b][red]This message was edited by dandigiovani at 2004-2-1 17:59:25[/red][/b][hr]
Do we always have to use pointers,nodes,queue..etc to create and manipulate a tree and search trough the tree??

I have some difficulty while using Best-First Search to search trough a tree... :-D
The queue, nodes, pointers...etc, they make me confused.. :-(

Does anybody know any good and complete source or link to study pointers,tree,search method....???

Or could you give me any basic theory on it?

Thanx guys... I'll really appreciate it...
D A N D I (reads: Dun dee)

Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!