Tree and graph

A short slide about important Data structure Tree and Graph

1. Tree and Graph Muhaiminul Islam ID-150164

2. Discussion point Tree Introduction to Tree Terminologies used in Trees BST Traversing a Tree Application of a Tree Graph Directed V s Undirected Graph Application

3. Tree In mathematics, and more specifically in graph theory, a  tree  is an undirected graph in which any two vertices  are connected by  exactly one  path . In other words, any acyclic connected graph is a tree.

4. Terminologies used in Trees Root Parent Child Leaf

5. Binary search Tree Binary search trees allow for fast insertion and removal of elements They are specially designed for fast searching. A binary tree consists of two nodes, each of which has two child nodes

6. Traversing a Tree Pre order ( root, left, right) In order( left , root, right) Post order( left , right, root)

7. Application of tree File system Store large volume of data Artificial intelligence Compiler design Text processing

8. Graph A data structure that consists of a set of nodes ( vertices ) and a set of edges that relate the nodes to each other

9. Directed VS Un directed Graph When the edges in a graph have a direction, the graph is called directed (or digraph ) When the edges in a graph have no direction, the graph is called undirected

10. Application Driving Map Airline traffic Computer network Cad/VLSI GPA Highway Maps Internet Web graph

11. Any Question?