| Traversal through BSTs |
|
|
|
|
|
|
|
|
|
|
| • | It
would traverse the same tree as: |
||||||||
| 5,10,15,20,30,40,60,65,70,85; |
|||||||||
| • | Notice
that this type of traversal produces the |
||||||||
| numbers
in order. |
|||||||||
| • | Search
trees can be set up so that |
||||||||
| all of the nodes in the left subtree |
|||||||||
| are less than the nodes in the |
|||||||||
| right subtree. |
|||||||||