#include <iostream>
using namespace std;
struct node {
	double data;
	struct node *next;
};
void printlist(node *list);

int main() {
	// your code goes here
	node *fir_node = new node();
	node *sec_node = new node();
	node *thir_node = new node();
	fir_node->data = 1;
	sec_node->data = 2;
	thir_node->data = 3;
	fir_node->next = sec_node;
	sec_node->next = thir_node;
	thir_node->next = nullptr;
	cout << "創建初始串列為:" << endl;
	printlist(fir_node);

	node *newnode = new node();
	newnode->data = fir_node->data - 0.5;
	newnode->next = fir_node;
	fir_node = newnode;
	cout <<"插入在頭端後的串列為"<< endl;
	printlist(fir_node);
	return 0;
}

void printlist(node *list) {
	node *cur = new node(); //宣告一個指標，並指向initial list
	cur = list;
	while (cur != nullptr) {
		cout << cur->data << endl;
		cur = cur->next;
	}
	//delete cur;
}