Nachiket Kanore nachiketkanore

## Stack_ArrayImplementation_OOP.cpp
// Stack - Object oriented implementation using arrays
#include <iostream>
using namespace std;
#define MAX_SIZE 101

class Stack
{
private:
  int A[MAX_SIZE];  // array to store the stack
	int top;   // variable to mark the top index of stack.

## BSTDeletion_CPP.cpp
/* Deleting a node from Binary search tree */
#include<iostream>
using namespace std;
struct Node {
	int data;
	struct Node *left;
	struct Node *right;
};
//Function to find minimum in a tree.
Node* FindMin(Node* root)

## Binary Search Tree.cpp
/*
** Binary Search Tree implementation in C++
** Harish R
*/
#include<iostream>
using namespace std;

class BST {

    struct node {

## i3-shortcuts-screenshot.md

      
              1 file
            
          
              14 forks
            
          
              36 comments
            
          
              164 stars
            
          
                dianjuar
                / i3-shortcuts-screenshot.md
            
            
              Last active
              July 2, 2024 08:10
            
              
                My i3 shortcuts to take screenshots
              
          
    Requirements


maim
xclip

Set-up

Set this on your i3 config file ~/.i3/config
# Screenshots
	// Stack - Object oriented implementation using arrays
	#include <iostream>
	using namespace std;
	#define MAX_SIZE 101

	class Stack
	{
	private:
	int A[MAX_SIZE]; // array to store the stack
	int top; // variable to mark the top index of stack.
	/* Deleting a node from Binary search tree */
	#include<iostream>
	using namespace std;
	struct Node {
	int data;
	struct Node *left;
	struct Node *right;
	};
	//Function to find minimum in a tree.
	Node* FindMin(Node* root)
	/*
	** Binary Search Tree implementation in C++
	** Harish R
	*/
	#include<iostream>
	using namespace std;

	class BST {

	struct node {