Skip to content

akshayarora2009/Works

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
Convert Infix expression to Postfix
Convert Infix expression to Postfix
 
 
Convert a binary tree to Linked List (Pre-ordered)
Convert a binary tree to Linked List (Pre-ordered)
 
 
Create Binary Search Tree out of Pre-order Traversal
Create Binary Search Tree out of Pre-order Traversal
 
 
Evaluation of PostFix Expressions
Evaluation of PostFix Expressions
 
 
Find level of maximum sum in a Binary Tree
Find level of maximum sum in a Binary Tree
 
 
Fire Station Problem
Fire Station Problem
 
 
Heap Sort
Heap Sort
 
 
Implementation of Dijkstra's Algorithm
Implementation of Dijkstra's Algorithm
 
 
Implementation of Doubly Linked List
Implementation of Doubly Linked List
 
 
Implementation of a Circular Queue
Implementation of a Circular Queue
 
 
Implementation of a Stack
Implementation of a Stack
 
 
Insertion Sort
Insertion Sort
 
 
Josephus Problem
Josephus Problem
 
 
Linear Linked List Implementation
Linear Linked List Implementation
 
 
Linear Queue
Linear Queue
 
 
Merge Sort
Merge Sort
 
 
Merge two Linked Lists together
Merge two Linked Lists together
 
 
Merge two Linked lists only with common elements
Merge two Linked lists only with common elements
 
 
Number of Leaf nodes in a binary Tree
Number of Leaf nodes in a binary Tree
 
 
QuickSort Implementation
QuickSort Implementation
 
 
README.md
README.md
 
 
Remove even elements from a Circular Queue
Remove even elements from a Circular Queue
 
 
Representation of Big Integers using Linked Lists
Representation of Big Integers using Linked Lists
 
 
Representation of Polynomials using Linked Lists
Representation of Polynomials using Linked Lists
 
 
Reverse a string using stacks
Reverse a string using stacks
 
 
Search in a Linear Linked List
Search in a Linear Linked List
 
 
Selection Sort
Selection Sort
 
 
Sparse Matrix using Linked Lists
Sparse Matrix using Linked Lists
 
 
Time Analysis of finding Max Min using Brute Force
Time Analysis of finding Max Min using Brute Force
 
 
Time Analysis of finding Max Min using Divide and Conquer
Time Analysis of finding Max Min using Divide and Conquer
 
 
Transform a given Binary Tree to its mirror image
Transform a given Binary Tree to its mirror image
 
 

Repository files navigation

Works

This repository is a collection of some of the programs I have written in C and C++. Covers basic to advanced data structures and complex algorithms. All programs are tested to run in Microsoft Visual Studio 2012 Professional IDE.

About

Collection of some of the mini projects undertaken

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases 1

Mini Projects Latest
Dec 8, 2014

Packages

No packages published