Binary Tree: A Non-linear Data Structure (1)

A Binary Tree is a Tree data structure with two children or less. We commonly refer to them as the left and right child as each element in a binary tree can only have two children.

Representation of a Binary Tree

A pointer to the topmost node of a binary tree serves as its representation. The root’s value is NULL if the tree is empty.

The following components are found in a binary tree node:

1. Data
2. Pointer to left child
3. Pointer to right child

Basic Binary Tree Operation:

• adding a new element.
• deleting a component.
• looking for something.
• traversing a barrier.

Additional Binary Tree Operation:

• determining the tree’s height
• Finding the tree’s level.
• Finding the size of the entire tree.

Very soon we’ll dive more into the topics ….