- In an array binary tree, the nodes of the tree are stored in an array.
- Position 0 is left empty.
- The root is stored in position 1.
- For the element in position n,
- The left child is in position 2n.
- The right child is in position 2n + 1.
- For the element in position n,
- The parent is in position n/2.
- This representation is very efficient when
- The tree is full, and
- The structure of the tree will not be modified.
- Position 0 is left empty.
- Linked Implementation
- In a linked binary tree, each node contains pointers to its left and
right children.
- A linked binary tree object has one data member:
BinaryTreeNode* root- A pointer to the root node.
- In a linked binary tree, each node contains pointers to its left and
right children.
Return to Lectures page
This page was last modified on Apr 6, 2001
URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/BinaryTreeImplementations.html