Parenthesis checker
Application of Stacks Parenthesis checker It is an algorithm that confirms that the number of closing parenthesis equals opening parenthesis by using […]
Category: Data Structures using C Language
Polish Notations
Polish Notations In the early 1920s, a Polish logician, Jan Lukasiewicz invented a special notation for prepositional logic that allows to eliminate […]
Program for representing multiple stacks in one array
Multiple Stacks in an array Program for representing multiple stacks in one array /*Implementing multiple stacks in a single array*/ #include <stdio.h> […]
Representing two stacks in an array
Stacks Representing two stacks in an array One array may be considered to be composed of multiple stacks, such that the size […]
Program to implement Stack using Linked List
Stacks Program to implement Stack using Linked List: /*Implementation of stacks using linked list*/ #include <stdio.h> #include <stdlib.h> #include <conio.h> #define MAX […]
Trees
Trees Definitions: Binary Tree: A binary tree is either empty or it consists of a node called the root together with two […]
Threaded Binary Trees
Threaded Binary Trees Threaded Binary Trees are an improvement over Binary Search Trees that uses stack for iterative traversal. If a strategy […]
Program to implement In-Threaded Binary Tree
In-Threaded-Binary Tree Program to implement In-Threaded Binary Tree: /*In-threaded Binary Tree*/ #include <stdio.h> #include <conio.h> #include <stdlib.h> typedef struct threadedbinarytree { int […]
Program to implement Right-In-Threaded Binary Tree
Right-In-Threaded Binary Tree Program to implement Right-In-Threaded Binary Tree: /*Right In Threaded Binary Tree*/ #include <stdio.h> #include <conio.h> #include <stdlib.h> typedef struct […]
Program to implement Left-In-Threaded Binary Tree
Left-In-Threaded Binary Tree Program to implement Left-In-Threaded Binary Tree: /*Left In Threaded Binary Tree*/ #include <stdio.h> #include <conio.h> #include <stdlib.h> typedef struct […]