how to do binary tree bst search?
| Author |
Message |
greenapplesodaex
|
 Posted: Tue Jul 12, 2005 4:09 pm Post subject: how to do binary tree bst search? |
|
|
bst, bresth first or level order search (excuse my spelling)
assume the tree class is given
you can getRootItem(), getLeftNode(), getRightNode(), and other set and attach methods (but i dont think you need those for this)
I want to print the tree in lvl order, can anyone show me a way to do this please? thanx (psodle code is ok too) |
|
|
|
|
 |
Sponsor
Sponsor
|
|
|
wtd
|
|
|
|
|
c5jim
|
| Posted: Thu Jul 14, 2005 12:39 pm Post subject: (No subject) |
|
|
d   |
|
|
|
|
|
c5jim
|
| Posted: Thu Jul 14, 2005 12:40 pm Post subject: (No subject) |
|
|
et  |
|
|
|
|
|
|
|
Register
Wiki
Blog
Search
Turing
Chat Room
Members
