21-11-2012, 01:35 PM
SEMINAR ON: Trees in Data Structure
IT TREE.pptm (Size: 319.73 KB / Downloads: 35)
WHAT IS A TREE ?
Non linear data structure
Hierarchical arrangement of data
Has components named after natural tree:
root
branches
leaves
Drawn with root at the top.
WHY TREES ?
Advantage of Linked lists:
sequential representation of data structures.
But one weak feature:
it is necessary to move through them only one position at a time.
Overcome by trees as data structures .
COMPONENTS OF A TREE
NODE: Stores a data
element.
PARENT: Single node that
directly precedes a node.
CHILD: one or more
nodes that directly
follows a node.
LEAF: node with no
children.