A LEVEL COMPUTING
Data Structures
Theory
15. The BINARY TREE
The TREE is a general data structure that describes the relationship between data items or 'nodes'.
The parent node of a binary tree has only two child nodes.

The typical operations that can be carried out on a Binary Tree are
| Operations on a Binary Tree | |
|---|---|
| CREATE | Create a new tree |
| LEFT | Get the Left sub-tree |
| RIGHT | Get the Right sub-tree |
| ITEM | Get the data item within the root node |
| EmptyTree | Informs whether or not the tree is empty |
| INSERT | Place a node at a specific location within the tree |
| DELETE | Remove a node from a specific location within the tree |
Challenge see if you can find out one extra fact on this topic that we haven't already told you
Click on this link: The Binary Tree
Copyright © www.teach-ict.com

