Data Structure

C# Boyer-Moore String Search Example

In this article, I will show you the implementation of the ==Boyer-Moore == algorithm. Boyer Moore is a string searching algorithm. It avoids checking most positions in the source string. The implementation here uses constant ch…

Delete node from linked list with specific value

In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collecti…

Implement Trie Data Structure in Typescript/JavaScript

As per the Wikipedia In computer science, a trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, w…

Generic Queue Implementation in C# Using Linked List

What are the characteristics of a queue? The queue is A linear data structure with two points of access: front and back. Items can only be added to the back (enqueue) and retrieved from the front (retrieve) (dequeue) The Fir…

Delete Node In Binary Search Tree -C#

This is the continuation of How to create a binary search tree in c# In this post, I will show you how to remove the node from Binary Search Tree.{alertInfo} There are three cases. The node has no children (it’s a leaf no…

Binary Heap -Min and Max heap using Typescript

Binary heap How heap store the data Adding Element to heap Extract Min Element Interview Questions Binary heap The binary heap was introduced by J. W. J. Williams in 1964, as a data structure for heapsort . [2] …

QuickSort implementation in TypeScript using recursion

This post will discuss how to implement the QuickSort algorithm in typescript/javascript. Quicksort is the fastest algorithm. Quicksort works on the divide and conquer strategy. All languages in the world provide sorting fun…

تحميل المزيد من المشاركات
لم يتم العثور على أي نتائج