| Summary: |
Binary search tree is an important type of tree. We have already seen how the different types of traversals and deletion operations can be performed. Finding a node location is an important first step for many of the other operations, such as insertion and deletion.
The operations must obey the ordering property of the binary search tree (BST).
In this week we will:
• Understand and apply the important operations on binary search trees
• Learn how to use recursive operations to process trees
• Consider other types of tree structures |
| Creators: |
|
| Divisions: |
Academic > School of Computing, Engineering and Built Environment > Department of Computing |
| Copyright holder: |
Copyright © Glasgow Caledonian University |
| Viewing permissions: |
World |
| Depositing User: |
|
| Date Deposited: |
04 Jul 2018 13:17 |
| Last Modified: |
13 Feb 2020 09:39 |
| URI: |
https://edshare.gcu.ac.uk/id/eprint/3815 |
Loading previews...
