nWhat is Tree?
A Connected Graph that
contains no simple circuits is called a tree. Trees were used as long ago as
1857, when the English mathematicians Arthur Cayley used them to count certain
types of chemical compuonds. Since that time, trees have been used in
different deciplines. Trees is very usefull in computer science. it is used to
construct an effiecient algorithm to find an item in a
list.
What is a Graph?
Graphs are discrete structure consisting of vertices and edges
that connect this vetices
What is a root?
Root of a tree is the top most node. in the picture root is
(A)
What is a leaf?
Leaf is at the bottom most node. In the picture leaves are (Q), (W) , (K)
& (M)
What is a child?
Child nodes are underneth the Parent. In the Picture C is a child of
(A)
What is a parent?
Parents are nodes that have children. In the Picture A is a parent
of (C) & (B)
What is a siblings?
Siblings are child with same parents. In the Picture (B) &
(C) are siblings
Definitions:
1) A tree is a connected undirected graph with no simple
circuits
2) A rooted tree is called an M-ary tree if every internal vertex has no
more than m chidren. The tree is called a full m-ary if every internal vertex
has exactly m chidren. An m-ary tree with m=2 is called a Binary
Trees.
