Welcome to my Presentation on Data Structure

Name : Md Ahasan Habib

Id : 20191014010
Sec : A
Second Pattern Matching Algorithm

 By this second pattern matching algorithm

we can find out if a Pattern exists in a
String or not And if exist we can find out
the Position of the pattern in the string.
Bubble sort
 Bubble sort, sometimes referred to as sinking
sort, is a simple sorting algorithm that
repeatedly steps through the list, compares
adjacent elements and swaps them if they are in
the wrong order. The pass through the list is
repeated until the list is sorted.

 Assume list is an array of n elements. We

further assume that swap function swaps the
values of the given array elements.
Postfix Expression

 Postfix notation is a notation for writing

arithmetic expressions in which the operands
appear before their operators. Using
Stacks. Postfix notation is a notation for writing
arithmetic expressions in which the operands
appear before their operators.
Infix Expression

 Infix, Postfix and Prefix notations are three

different but equivalent ways of
writing expressions. It is easiest to
demonstrate the differences by looking at
examples of operators that take two
operands. Infix notation: X + Y.
Binary Tree

 A full binary tree is a tree in which every node

other than the leaves has two children.
A complete binary tree is a binary tree in which
every level, except possibly the last, is
completely filled, and all nodes are as far left as
possible.
Thanks for watching. Have a good day.