Mavzu: Daraxtsimon maʻlumotlar tuzilmalari. Taʻriflar va xususiyatlari. Reja

#include
#include

class TreeNode {
public:
int data;
std::vector children;

TreeNode(int value) : data(value) {}

void addChild(TreeNode* child) {
children.push_back(child);
}
};

int main() {
TreeNode* root = new TreeNode(1);

root->addChild(new TreeNode(2));
root->addChild(new TreeNode(3));

TreeNode* node2 = new TreeNode(4);
node2->addChild(new TreeNode(5));
node2->addChild(new TreeNode(6));

root->children[0]->addChild(node2);

root->children[1]->addChild(new TreeNode(7));

std::cout << "Daraxt tuzildi." << std::endl;

delete root;
return 0;
}




Xulosa: Men bu mustaqil ishdan Daraxtsimon maʻlumotlar tuzilmalari. Taʻriflar va xususiyatlari. bo’yicha ko’plab ma’lumotlar oldim.


Foydalangan adabiyotlar:
http://fayllar.org
https://hozir.org/mavzu-chiziqsiz-malumotlar-tuzilmasi-daraxtsimon-malumotlar-tu.html
https://uniwork.buxdu.uz/resurs/13760_2_55B36B705B091F88FA1174F540C2078B084B3BCD.pdf