C / C++ / MFC

void double_llist::loadfromfile(){

    string mname,mgenre,mlanguage;
    int mrelease_year,mamount, mrating,mruntime;
        ifstream fromfile;
        fromfile.open("database.txt");
        while (fromfile >> mname >> mgenre >> mlanguage >> mrelease_year>>mamount>>mrating>>mruntime)
    {
        /* do something with name, var1 etc. */
        cout << mname<<mgenre<<mlanguage<<mrelease_year<<mamount<<mrating<<mruntime<<endl;
    create_list(mname,mgenre,mlanguage,mrelease_year,mamount,mrating,mruntime);
    }
}

void double_llist::create_list(string mname,
    string mgenre,
    string mlanguage,
    int mrelease_year,
    int mamount,
    int mrating,int mruntime)
{

    struct node *s, *temp;
    temp = new(struct node);
    temp->info=id++;
    temp->name = mname;
    temp->genre=mgenre;
    temp->language=mlanguage;
    temp->release_year=mrelease_year;
    temp->amount=mamount;
    temp->rating=mrating;
    temp->runtime=mruntime;
    temp->next = NULL;
    if (start == NULL)
    {
        temp->prev = NULL;
        start = temp;
    }
    else
    {
        s = start;
        while (s->next != NULL)
            s = s->next;
        s->next = temp;
        temp->prev = s;
    }
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<fstream>
/*
 * Node Declaration
 */
using namespace std;
struct node
{
    int info;
    string name;
    string genre;
    string language;
    int release_year;
    int amount;
    int rating;
    int runtime;
    struct node *next;
    struct node *prev;
    static int counter;
}*start;
int id=1;
/*
 Class Declaration
 */
class double_llist
{
    public:

        void create_list(string mname,
    string mgenre,
    string mlanguage,
    int mrelease_year,
    int mamount,
    int mrating,int mruntime);
        void delete_element(int value);
        void search_element(node *head, int value);
        void display_dlist();
        void sorting();
       void update(node *q ,int value);
        int count();
        void reverse();
        void savetofile();
        void loadfromfile();
        void revertsort();
        double_llist()
        {
            start = NULL;

        }
};

#include<stdlib.h>
#include<stdio.h>
struct tree
{
	char info;
	struct tree *left;
	struct tree *right;
};
struct tree *root;
struct tree *stree(struct tree *root,struct tree *r,char info);
void print_tree(struct tree *root,int l);
int main(void)
{
	char s[80];
	int l=3;
	root=NULL;
	do
	{
		printf("enter a letter:");
		gets(s);
		root=stree(root,root, *s);
		
	}
	while(*s);
	print_tree(root,0);
	return 0;
	
}
struct tree *stree(struct tree *root,struct tree *r,char info)
{
	if(!r)
	{
		r=(struct tree *) malloc(sizeof(struct tree));
		if(!r)
		{
			printf("out of memory \n");
			exit(0);
			
		}
		r->left=NULL;
		r->right=NULL;
		r->info=info;
		if(!root)
		return r;
		if(info<root->info)
		root->left=r;
		else
		root->right=r;
		return r;
		
	}
	if(info<r->info)
	stree(r,r->left,info);
	else
	stree(r,r->right,info);
	return root;
}
	void print_tree(struct tree *r,int l)
	{
		int i;
		if(!r) return ;
		print_tree(r->right,l+1);
		for(i=0;i<l;++i)
		printf(" ");
		printf("%c \n",r->info);
		print_tree(r->left,l+1);
		
	
}