Key tree terminologies

The tree is a non-linear (two-dimensional) data structure so that it can be drawn in many more complex ways than sequential data structures, such as arrays and linked lists. Trees may exhibit unique properties depending on their shape, size, and structure. We need special terminologies to identify and express a tree's properties and characteristics correctly. These terminologies make it easier for us to express the different characteristic properties of trees and categorize them together. Some of the most widely used tree terminologies are listed below.

These terminologies are not specific to binary trees but can be used for any tree in general (binary search trees, n-ary trees, etc.).

Root

The root is the only node in the tree without a parent. It is the topmost node from which we can reach any node in the tree.

Root Node

Leaf

The nodes in the tree which do not have any children are called the leaf nodes.

Liking the course? Check our discounted plans to continue learning.

Subscribe