Trees are a hierarchical data structure with nodes connected by parent-child relationships. They can be traversed in different orders like preorder, inorder, and postorder. Tree traversal involves visiting each node by first traversing the left subtree, then visiting the root, and finally traversing the right subtree for preorder, or traversing the left subtree, visiting the root, and traversing the right subtree for inorder. Trees have properties like paths, roots, parents, children, leaves, and subtrees.

3. Data structures for Tree.
In computer science, a tree is a widely used
abstract data type (ADT)—or data structure
implementing this ADT—that simulates a
hierarchical tree structure, with a root
value and subtrees of children with a parent
node, represented as a set of linked nodes.
This is often done via a stack (LIFO)
or queue (FIFO).

5. Tree Properties
Path
Root
Parent
Child
Leaf
Subtree
Visiting
Traversing
Levels
Keys

6. A way to totally order the vertices of and ordered rooted
tree . We do this recursively:
 Label the root with integer number 0.Then label its k
children from left to right with 1,2,3,...,k.
 For each vertex v at level A , label its Kv children ,as
they drawn from left to right ,with A.1,A.2,…A.Kv.
Universal Address System

8. What is Tree Traversal…??
Tree traversal is a form of graph traversal..
It refers to the process of visiting each node
in a tree data structure..

9. Preorder traversal:
Visit the root.
Traverse the left subtree .
Traverse the right subtree.
Pre-order

11. Inorder
Inorder traversal:
Traverse the left subtree .
Visit the root.
Traverse the right subtree.
D B E A F C G

12. Postorder
Postorder traversal:
Traverse the left subtree.
Traverse the right subtree.
Visit the root.
D E B F G C A

13. Graph
Vertex Edges

14. Two Types Of Graph
Directed Undirected

15. Adjacent Graph