linkedlist.cpp

#include <bits/stdc++.h>

using namespace std;

struct Node {
	int data;
	Node* next;
};

Node* getNode(int data)
{
	Node* newNode = new Node;
	newNode->data = data;
	newNode->next = NULL;
	return newNode;
}

void deleteGreaterNodes(Node** head_ref, int x)
{
	Node *temp = *head_ref, *prev;

	if (temp != NULL && temp->data > x) {
		*head_ref = temp->next;
		free(temp);
		temp = *head_ref;
	}

	while (temp != NULL) {

		while (temp != NULL && temp->data <= x) {
			prev = temp;
			temp = temp->next;
		}

		if (temp == NULL)
			return;

		prev->next = temp->next;

		delete temp; 

		temp = prev->next;
	}
}
void printList(Node* head)
{
	while (head) {
		cout << head->data << " ";
		head = head->next;
	}
}

int main()
{
	// Create list: 7->3->4->8->5->1
	Node* head = getNode(7);
	head->next = getNode(3);
	head->next->next = getNode(4);
	head->next->next->next = getNode(8);
	head->next->next->next->next = getNode(5);
	head->next->next->next->next->next = getNode(1);

	int x = 6;

	cout << "Original List: ";
	printList(head);

	deleteGreaterNodes(&head, x);

	cout << "\nModified List: ";
	printList(head);

	return 0;
}