Hashing Functions with Example Hashing Functions with Example is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Characteristics of a Good Hash Function A good hash function avoids collisions. Moreover, A good hash function tends to spread keys evenly in the array. A […]

# Data Structure

## Hashing – Hash Table Data Structure | Freestudy9

Hash Table Data Structure Hash Table Data Structure is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Sequential search requires, on the average O(n) comparisons to locate an element. So many comparisons are not desirable for a large database of elements. Binary search […]

## Spanning Tree – Applications of Graph | Data Structure

Spanning Tree Spanning Tree is the important topic of the Data structure. Moreover, Freestudy9 has all kind of information related to it in detail. A Spanning tree of a graph is an undirected tree consisting of only those edges necessary to connect all the nodes in the original graph A spanning tree has the properties […]

## Traversing Techniques of the Graph with Algorithms

Traversing Techniques Traversing Techniques is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Most graph problems involve traversal of a graph. Traversal of a graph means visit each node exactly once. Two commonly used graphs Traversing Techniques are Depth First Search (DFS) Breadth […]

## Height Balanced Tree – Rebalancing in Height Balanced Tree

Height Balanced Tree Height Balanced Tree is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. A tree is called AVL (height-balanced binary tree) if each node possesses one of the following properties A node is called left heavy if the longest path in […]

## Threaded Binary Tree – Data Structure | Freestudy9

Threaded Binary Tree Threaded Binary Tree is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. The wasted NULL links in the binary tree storage representation can replaced by threads. A binary tree is threaded according to particular traversal order. e.g.: Threads for the inorder […]

## Algorithm of Preorder, Inorder and Postorder Traversal Techniques

Traversal Technique Traversal Technique is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Procedure: RPREORDER(T) Given a binary tree whose root node address is given by pointer variable T and whose node structure is same as described below. Also, This procedure traverses the […]

## Preorder, Inorder and Postorder Traversal Techniques

Traversal Techniques Traversal Techniques is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. The most common operations performed on tree structure is that of traversal. Also, This is a procedure by which each node in the tree processed exactly once in a systematic […]

## Nonlinear Data Structure – Graph and Tree | Basic Terms

Nonlinear Data Structure Graph Nonlinear Data Structure Graph is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Simple Path (Edge Simple) A path in a digraph in which the edges are distinct is called simple path or edge simply. Elementary Path (Node Simple) […]

## Primitive Operations of the Stack using Linear Array and Linked List

Stack using Linear Array Stack using Linear Array is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Implement PUSH and POP Stack using Linear Array #define MAXSIZE 100 int stack[MAXSIZE]; int top=-1; void push(int val) { if(top >= MAXSIZE) printf(“Stack […]