Algorithm Guide: Tree Data Structure Terminology

Before we walk through how the tree data structure can be utilized to manage data, there are some key terminologies you should become familiar with. This guide walks through each of these terms. You can use this guide as reference/cheat sheet for the tree data structure terminology.

Root

Definition: The very top node of a tree.

tree data structure terminology

Child

Definition: Any node connected to another node, while moving away from the root node.

tree data structure terminology

Parent

Definition: A node that contains child nodes

tree data structure terminology

Siblings

Definition: Multiple nodes connected to the same parent node.

tree data structure terminology

Leaf

Definition: A node with no child nodes.

tree data structure terminology

Edge

Definition: Connection between one node to another node.

tree data structure terminology

Path

Definition: A sequence of nodes connecting a node with a descendant node.

tree data structure terminology

Tree Height

Definition: Number of edges in the longest path from the root to the leaf node.

tree data structure terminology

Depth

Definition: Number of edges from a node to the tree’s root node.

tree data structure terminology

Summary

Now that you have a good idea of the key terms associated with trees you’re ready to start walking through each of the key structures and how they can be used.

Jordan Hudgens

view all post
Leave a comment

Please be polite. We appreciate that.

By Daniele Zedda • 18 February

← PREV POST

By Daniele Zedda • 18 February

NEXT POST → 34
Share on