Talabalar ismlari ketma-ketligidan binar daraxt hosil qilish algoritmi va dasturini tuzing

4-topshiriq

1. 
   Talabalar ismlari ketma-ketligidan binar daraxt hosil qilish algoritmi va dasturini tuzing.
   

#include

using namespace std;

struct tree

{
string name;
tree *left;
tree *right;
};

void printTree(tree *value){

if (value==nullptr)return;
cout<<"\n"<name;
printTree(value->right);
printTree(value->left);
}

tree *addData(string name){

tree *newData=new tree();
newData->name=name;
newData->left=newData->right=nullptr;
return newData;
}
int main(){

tree *head=addData("Abulqosim");

/*
Abulqosim
/ \
Nargiza Feruza
/ \ / \
Ozoda Muslima Lola Madina

*/
head->left=addData("Nargiza");

head->left->left=addData("Ozoda");
head->left->right=addData("Muslima");

head->right=addData("Feruza");

head->right->right=addData("Madina");
head->right->left=addData("Lola");

printTree(head);

return 0;
}