Scribd
Upload
79 views

Some Important Program

This document discusses various data structure operations. It defines insert as adding a new element to an array, and delete as removing an element from an array. It also defines push as inserting an element into a stack, and pop as deleting an element from a stack. Linked lists are described as a linear collection of data elements linked through pointers.

Uploaded by

Mehedi Hasan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
79 views

Some Important Program

This document discusses various data structure operations. It defines insert as adding a new element to an array, and delete as removing an element from an array. It also defines push as inserting an element into a stack, and pop as deleting an element from a stack. Linked lists are described as a linear collection of data elements linked through pointers.

Uploaded by

Mehedi Hasan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

BUBBLE SHORT*1

BINARY SEARCH*1

Insert: Insert refers to the adding a new


element to an array
Deliting:Deleting refers to the operation
of removin one of the elements
from an array.

Insert: Insert refers to the adding a new


element to an array.
linearscarch or sequential scarch
Linked list: sA linked list or one way list is
a linear collection of
Linked list:

Pop: Pop is the term used to delete an


element from a stack

Push: Push is the term used to insert an


element into a stack.

Push:

You might also like