Binary Tree Nodes

A binary tree node has three components.
- A value (data) that contains the tree element.
- A left pointer (left) that points to the root node of the left subtree.
- A right pointer (right) that points to the root node of the right subtree.
Nodes are allocated and deallocated dynamically.
The binary tree always has allocated the exact number of nodes necessary to store the tree elements.
Example - binarytreenode.h

This page was last modified on Apr 10, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/BinaryTreeNodes.html