Week 7 was the introduction to tree structures in python. More to the point we learned about a specific type of tree called a binary search tree. While a regular tree can contain as many branches as possible on any particular node, a binary node can only have up to two branches.
 |
| Search Tree |
 |
| Binary Search Tree |
 |
| Regular tree (just in case you were still confused) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
One of the advantage of using a binary search tree is that calling an inorder recursive search function on the tree will return the values from lowest to highest. As Jeremy mentioned in his
blog there are two other ways to recurse through a tree, preorder and postorder. He uses a letter system to describe the three orders which I find particularly helpful in understanding.
No comments:
Post a Comment