2-variant Masalaning qo’yilishi: Haqiqiy sonli binar daraxt uchun tugunlar o’rta-geometrik qiymatini hisoblash va uni daraxtga qo’shish dasturini tuzing. Dastur kodi

O‘ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI

LABORATORIYA ISHI № _6_

Guruh: 716-19

Bajardi: Aktamov F

Tekshirdi: Djangazova Q

Toshkent–2020

DARAXTSIMON TUZILMALARNI TADQIQ QILISH

2-variant

Masalaning qo’yilishi:

2. Haqiqiy sonli binar daraxt uchun tugunlar o’rta-geometrik qiymatini hisoblash va uni daraxtga qo’shish dasturini tuzing.

Dastur kodi:

#include

#include

using namespace std;

#define COUNT 2

class Node{

public:

int data;

Node* left, *right;

Node(int data){

this->data = data;

this->left = NULL;

this->right = NULL;

}

};

void printTree(Node *root, int space){

if (root == NULL)

return;

space += COUNT;

printTree(root->right, space);

for (int i = COUNT; i < space; i++)

cout<<"\t";

cout<data<<"\n";

printTree(root->left, space);

}

int main(){

Node *root = new Node(43);

root->left = new Node(25);

root->right = new Node(67);

root->left->left = new Node(14);

root->left->right = new Node(51);

root->right->left = new Node(26);

root->right->right = new Node(97);

root->left->left->left = new Node(81);

cout << "**************Binar daraxt elementlarini ekranga chiqqarish**************\n\n";

printTree(root, 0);

// o'rta geometrik qiymatini hisoblash

float key = pow(43*25*67*14*51*26, 1./6);

cout << "\n\n\n\n************** Natija ************** \n\n";

// o'rta geometrik qiymatini daraxtga qo'shish

root->right->right->right = new Node(key);

printTree(root, 0);

return 0;

}