A tree is a widely used
abstract
data type that simulates a hierarchical tree structure, with a set of nodes and edges connecting them
Trees consist of nodes and edges, where each
node
holds its own data and a reference to its children
The
root
node is the topmost node in the tree, and it doesn't have any incoming edges.
Similarly
leaf
nodes are the nodes that don't have any children.
The
height
of a tree is the maximum distance from the root to a leaf node.
Trees can be balanced or unbalanced and balanced trees have a more
uniform
structure
Some common
operations
on trees include insertion, deletion, search, and traversal
Comprehensive guide to double ended queue in 2023