5 Unpopular Tree Data Structures To Level Up As A Software Developer

Have you used Treaps & Segment Trees before?

Generated with DALL-E 3

A Tree is a non-linear hierarchical data structure consisting of nodes connected by edges.

The topmost node in a tree is called the Root Node.

Each node in a tree can have zero or more Child nodes. These nodes are called Parent Nodes.

The nodes with no children are called Leaf nodes.

The Height/ Depth of a tree is the length of the longest path from the root node to a leaf node.

Time & Space Complexity of Operations In A Tree

Searching for data, Insertion and Deletion operations in a tree have a Time & Space complexity of O(n).

Now that we know about a general Tree, let’s discuss the 5 lesser-known data-based structures that will level you up as a developer!