Topsomethingup: Data Structures

Showing posts with label Data Structures. Show all posts

Showing posts with label Data Structures. Show all posts

Data Structures example of trees introduction to data structures Trees types of trees in data structure

Warshall’s Algorithm

Warshall’s Algorithm Directed Graph G Algorithm: (Warshall’s algorithm) A directed graph G with M nodes is maintained in...Read More

Data Structures Trees types of trees in data structure

Deletion in a Binary search tree

Deletion in a Binary search tree Suppose T is a binary search tree, and an ITEM of information is given. This section g...Read More

Arrays in Data Structure Data Structures example of trees Trees

Insertion Into Binary Search Tree

Binary Search Tree is a node-based binary tree data structure which has the following properties: The left subtree of a node contains...Read More

Data Structures example of trees Trees

Binary Search Tree Algorithm

Binary Search Tree Algorithm Suppose T is a binary tree. Then, T is called a binary search tree (or binary sorted tree) if each n...Read More

Data Structures example of trees Tree Postorder traversal Algorithm Trees

Tree Postorder traversal Algorithm

The Postorder traversal algorithm is more complicated than the preceding two algorithms, because here we may have to save a node N in two d...Read More

Data Structures example of trees Tree Inorder traversal algorithm Trees

Tree Inorder traversal algorithm

The inorder traversal algorithm also uses a variable pointer PTR, which will contain the location of the node N currently being scanned, a...Read More

Data Structures example of trees Trees

Preorder Traversal Algorithm

The preorder traversal algorithm uses a variable PTR (pointer) which will contain the location of the node N currently being scanned. Here...Read More

Data Structures example of trees How To Traverse Binary Trees Trees

How To Traverse Binary Trees

There are three standard ways of traversing a binary tree T with root R. These three algorithms, called preorder, inorder and postorder, ...Read More

Data Structures example of trees Representing Binary trees in memory Trees

Representing Binary trees in memory

Let T be a binary tree. The two ways of representing T in memory are: Link representation (Linked list) Sequential representation (Array...Read More

Data Structures example of trees Trees

Trees In Data Structures

Tree is a type of non-linear hierarchical data structure in which there is a main node called as the ‘root node’ of the tree and there are ...Read More

Data Structures priority queue in data structure queue algorithm QUEUES Representation of Queues

Representation of Queues in Data Structures

Queues may be represented in the computer in various ways, usually by means at: Linear arrays One-way lists. Linear array in Queue...Read More

Data Structures priority queue in data structure QUEUES QUEUES In Data Structure stack and queue

QUEUES In Data Structure

A queue is a linear list of elements in which deletion can take place only at one end, called the ‘front’ and insertion can take place only...Read More

Data Structures Quicksort Algorithm in Data Structures stack and queue Stacks top stacks

Quicksort Algorithm in Data Structures

Quicksort is an algorithm of the divide-and-conquer type. That is, the problem of sorting a set is reduced to the problem of sorting two sm...Read More

Data Structures Memory Representation of Stacks stack and queue Stacks stacks and queues top stacks

Memory Representation of Stacks

In this article, we'll take a look at the various methods to represent stacks in memory. There are two ways to represent stacks in me...Read More

Data Structures stack and queue Stacks top stacks What are Stacks ?

What are Stacks in Data Structures?

A stack is a linear structure or a list of elements in which an element may be inserted or deleted only at one end, called the top of the s...Read More

circular linked list Data Structures Linked List

Header, Grounded header and Circular Linked Lists in Data Structures

Header Linked List A header linked list is a linked list which always contains a special node, called the ‘header node’, at the beginning...Read More

Arrays in Data Structure Data Structures

Traversing Linear Arrays

Let A be a collection of data elements stored in the memory of the computer. Suppose we want to print the content of each element of A or s...Read More

Data Structures Introduction Data Structures

Algorithms in data structure

An algorithm is a series of finite steps carried out in a sequence for solving a problem. In other words, an algorithm defines a series ...Read More

Data Structures Introduction Data Structures

Classification of Data Structure

Data Structure can be classified in two categories. According to these categories we can access or manage data according to our need. T...Read More

Data Structures Introduction Data Structures

Elementary Data Organization

In this article, we'll take a look about all the basic terms used in data structure. These terms are the building blocks of data struc...Read More

Subscribe to: Posts ( Atom )