A tree is a nonlinear data structure that consists of a root node and zero or more subtrees. The root node can have any number of child nodes, but each child can only have one parent. Nodes maintain a parent-child relationship, with one node designated as the root and the remaining nodes forming non-empty subtrees below the root. Trees allow for hierarchical categorization of data.

1. TREE
By
Prof. Sandeep Vishwakarma

2. DEFINITION
A tree is a nonlinear data
structure, compared to arrays,
linked lists, stacks and queues
which are linear data structures.
A tree can be empty with no nodes
or a tree is a structure consisting of
one node called the root and zero or
one or more subtrees.

3. PROPERTIES OF TREE
• A Tree is a recursive data structure containing
the set of one or more data nodes where one
node is designated as the root of the tree while
the remaining nodes are called as the children
of the root.
• The nodes other than the root node are
partitioned into the non empty sets where each
one of them is to be called sub-tree.
• Nodes of a tree maintain a parent-child
relationship between them.
• In a general tree, A node can have any number
of children nodes but it can have only a single
parent.

16. Thank You