Home



Github link           : Source Code Repositories (github.com)
Design programs  : https://github.com/krishnaKSA/design_programs_in_c-
Design patterns    : https://github.com/krishnaKSA/design_patterns_cplusplus
Data structures     : https://github.com/krishnaKSA/datastructures
Multithreading     : https://github.com/krishnaKSA/Multithreading


Popular posts from this blog

Binary Heap in C++

Image
Implementation Binary heap data structure in C++.  This class implemeted for MAX HEAP data structure.  Github:  sourcecode/binaryheap.h #include <iostream> #include <vector> using namespace std; /* class binary heap (priority queue) */ /* This class implemented for MAX_HEAP */ template <typename T> class binaryheap { private: int heaptype; //Max heap or min heap. This class implemented for MAX_HEAP vector<T> heap; //heap datastructure public: //constructor binaryheap(int type) :heaptype(type) {} //parameterised constructor binaryheap(T *arr, int _size) { if (_size != 0) { for (int i=0; i<_size;i++) { //push all the elements to the vector heap.push_back(arr[i]); } } //heapify for (int i = (_size / 2) - 1; i >= 0; i--) { sink(i); } } //add the element void add(T elem) { int m_size = (int)heap.size(); //add element at the back heap.push_back(elem); if (m_size != 0) { //hea...
Read more

AVL Balance Binary Search Tree in C++

Image
Implementation of AVL Balance binary search tree in C++.  Github:  sourcecode/AVLbalancedtree.h #include <iostream> #include "queueusinglinkedlist.h" using namespace std; /* AVL balanced binary search tree class*/ template <typename T> class avlbalancedbst { private: /* node */ template <typename T>class Node { public: Node<T>* left; //left tree Node<T>* right; //right tree T data; //data int height; //height of the tree int bf; //balance factor //constructor Node<T>() :left(nullptr), right(nullptr) { } }; //root node Node<T>* root; public: //constructor avlbalancedbst() :root(nullptr) { } //add element void addrecursive(T elem) { //if the element is already found, return if (findelement(root, elem)) { return; } //add element root = addrecursive(root, elem); } //recursive call to add the element to the tree Node<T>* addrecursive(Node<T>* node, T elem) { //...
Read more