Learning Tree Data Structures From Scratch

A tree is a popular data structure that is non-linear in nature. Unlike other data structures like an array, stack, queue, and linked list which are linear in nature, a tree represents a hierarchical structure. The ordering information of a tree is not important. A tree contains nodes and 2 pointers.

The most common tree data structure is the binary tree. A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.

In this session, the speaker would guide you on how to start with Tree Data Structures and take your journey forward in this.

Support the community here: commudle.com/communities/cdn-data-structures-and-algorithms