A tree is a finite set of one or more nodes such that -There is a specially designated node called root.
Trees ADT
A tree
is a finite set of one or more nodes such that -
i) There
is a specially designated node called root.
ii) The
remaining nodes are partitioned into n >= 0 disjoint sets T1, T2, T3...Tn
T1,T2T3,
...T are called the sub-trees of the root.
The
concept of tree is represented by following Fig. 4.1.1.
Various
operations that can be performed on the tree data structure are -
1.
Creation of a tree.
2.
Insertion of a node in the tree as a child of desired node.
3.
Deletion of any node(except root node) from the tree.
4.
Modification of the node value of the tree.
5.
Searching particular node from the tree.
Data Structure: Unit III: Trees : Tag: : Definition, Example Operations | Data Structure - Trees ADT
Data Structure
CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation