[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]


    Search the Q&A Archives


Hello! I am trying to work out how to draw a binary tree on...

<< Back to: Binary Space Partitioning Trees FAQ

Question by sonique
Submitted on 8/6/2004
Related FAQ: Binary Space Partitioning Trees FAQ
Rating: Not yet rated Rate this question: Vote
Hello!
I am trying to work out how to draw a binary tree on paper(done that!) and work out the dimensions and 'box' so can work out a formula which can then be used in a Java programme. The programme will than 'draw' the binary tree on the screen(number of levels and node numbers will be generated at random), for people to 'search' it for a specific node and see if it is or is not in the tree.
I am searching the web, but any pointers on where I can look for assistance with working out the formula would be greatly appreciated!
Thanks for your time


Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: Binary Space Partitioning Trees FAQ


[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

© 2008 FAQS.ORG. All rights reserved.