node* p_before = find_element(number, k_beginning);	//return a pointer to an element we're trying to find			
	node* p_after = p_before->k_next;						
 
	node* k_new= new node;
	k_new->number= number;
	k_new->k_next= k_after;
	p_before->k_next= k_new;

add_before_element(5, p_beginning);

void add_before_element(int number, node*& p_beginning)
{
node* p_before = find_element(number, k_beginning);	//return a pointer to an element we're trying to find			
	node* p_after = p_before->p_next;						
 
	node* p_new= new node;
	p_new->number= number;
	p_new->p_next= p_after;
	p_before->p_next= p_new;
}

node* p_before = find_element(number, k_beginning);

add_before_element(5, p_beginning);   //This is a line somewhere in the program which calls a function for adding an element before a certain element passing a number and pointer to the beginning

void add_before_element(int number, node*& p_beginning)   //This is a function that is being called
{
node* p_before = find_element(number, k_beginning);	//There is another function called find_element() for finding an element and instead of the element it returns a pointer to that element and that pointer is called p_before
	node* p_after = p_before->p_next;   //Now, since the p_before is a pointer to the already found element, we make p_after a poitner to the next element of the found one -> p_before->p_next				
 
	node* p_new= new node;   //We make a new node called p_new
	p_new->number= number;  //Now we insert a number (5) in the newly created node
	p_new->p_next= p_after;  //And now we link the newly created node
	p_before->p_next= p_new;  //Same goes here
}

Adding a number before a certain number
Our list contains: 5, 3, 4, 8, 1, 2
Before what element would you like to insert a number? 1
What element would you like to insert? 45
Our list after the operation: 3, 4, 8, 1, 45, 2

Our list: 3, 2, 1 (I first input 1 then 2 then 3)
Element you'd like to add before? 1
Number: 45
Our list: 2, 45, 1
 

void print_out(node*& p_beginning)
{
	node* p_print = p_beginning;							
 
	while (p_print != 0)
	{
		cout << p_print->number << " ";						
                p_print = p_print->p_next;
	}
	cout << endl;
}