7
Tree Data Structures
Trees
are connected graphs
consisting of nodes and edges (called
links
), with no cycles
(no "up-links")
each node contains a
data
value
(or key+data)
each node has
links
to
≤ k
other child nodes
(
k=2
below)
![[Diagram:Pic/tree.png]](Pic/tree.png)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}