Heaps and Priority Queues
BunksAllowed
July 14, 2024
0
A priority queue is essentially a list of items in which each item has associated with it a priority. In general, ...
Read More
Showing posts with label Data Structures. Show all posts
Showing posts with label Data Structures. Show all posts
Interpolation Search in an Sorted Array
BunksAllowed
May 11, 2024
0
Interpolation search is a searching algorithm designed for sorted datasets. Unlike linear search, which checks each element sequential...
Read More
Binary Search in an Sorted Array
BunksAllowed
May 11, 2024
0
Binary search is a powerful search algorithm designed for sorted lists. It works by repeatedly dividing the list in half and elimina...
Read More
Linear Search in an Array
BunksAllowed
May 11, 2024
0
Linear search is a simple algorithm used to find a certain element in a list or array by sequentially checking each element until a ...
Read More
Binary Tree, Full Binary Tree, Complete Binary Tree
BunksAllowed
September 26, 2023
0
Binary Tree Definition : A tree with at most two children for each node. Formal Definition: A binary tree either is e...
Read More
Tree Data Structures
BunksAllowed
August 09, 2023
0
A tree is a fundamental data structure in computer science that organizes elements hierarchically. It consists of nodes connected by...
Read More
Graph Data Structures
BunksAllowed
July 28, 2023
0
In problems arising in computer science, mathematics, engineering, and many other disciplines we often need to represent arbitrary relat...
Read More
Sorting and Searching
BunksAllowed
July 27, 2023
0
Telephone directories are sorted alphabetically by last name. Why? Because a sorted index can be searched quickly . Even in the teleph...
Read More
Abstract Data Types
BunksAllowed
July 26, 2023
0
Although the terms "data type" (or just "type" ), "data structure" and "abstract data type" s...
Read More
Hashing With Chaining
BunksAllowed
March 09, 2023
0
This method maintains a chain of elements that have the same hash address. We can take the hash table as an array of pointers. The si...
Read More
Hashing With Quadratic Probing
BunksAllowed
March 09, 2023
0
Quadratic probing uses a hash function of the form: h(k, i)= (h ' (k) + c 1 i + c 2 i 2 ) mod m Where h ...
Read More
Hashing With Linear Probing
BunksAllowed
March 09, 2023
0
In open addressing, all elements are stored in the hash table itself. That is each table entry contains either an element of the dynami...
Read More
Introduction to Hashing
BunksAllowed
March 09, 2023
0
We have learned different search techniques where search time is basically dependent on the number of elements. In the case of an unsort...
Read More
B+ Tree
BunksAllowed
March 09, 2023
0
The B-tree structure is the standard organization for indexes in a database System . There are several variations of the B-tree and the m...
Read More
B Tree
BunksAllowed
March 08, 2023
0
In a multi-way search tree , many nodes have a left subtree but no right subtree. Similarly, they have a right subtree but no left subtre...
Read More
Threaded Binary Tree
BunksAllowed
March 08, 2023
0
In the case of the linked representation of a binary tree we find that half of the entries in the pointers fields LEFT and RIGHT will ...
Read More
Posts
