I am trying to solve a Binary Tree data structure problem, i think this
can be done from a DataBase Perspective with relations but then that
might involve doing something like a matrix to develop the relations
between nodes.

The other thought i have is solve the problem by using some native(Java/C++)
data Structure (Binary Tree /TreeMap) and store keys of the database
structure
as keys of the Binary Tree... that might relate to a simple select.

Any ideas are much appreciated.

Thanks,
Joe Eugene
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]

Reply via email to