#include using namespace std; //In this example using the binary tree graph. One vertex consist int data and 3 pointer to previous(*prev) and 2 next vertex(*right, *left). If root - pointer nullptr, if next doesnt exist - nullptr //class for storage one vertex information class vertex { private: int data; vertex *left,*right,*prev; bool exist; public: vertex() //constructor { left=right=prev=nullptr; exist=false; } //moving one vertex upper if its not root vertex* stepUp() {//cout<<"stepUp "<prev!=nullptr) if(this->prev->exist!=false) return this->prev; else return this; else return this; } //find free left or right place after *this. if not find move down in tree in random way. vertex* findFree() {//cout<<"findFree "<left==nullptr) return this; else if(this->right==nullptr)return this; else if(rand()%2==0)this->left->findFree(); else this->right->findFree(); } //create function return to *this object data and pointer to previous element void createVertex(int data,vertex *_prev) {//cout<<"createVertex start "<data=data; this->prev=nullptr; this->exist=true; cout<<"createVertex root. data " <data<left==nullptr) {this->prev=_prev; this->data=data; this->exist=true; _prev->left=this; cout<<"createVertex left. data "<data<right==nullptr) {this->prev=_prev; this->data=data; this->exist=true; _prev->right=this; cout<<"createVertex right. data "<data<data<left!=nullptr) this->left->printTree(); if(this->right!=nullptr) this->right->printTree(); } }; int main() { cout<<"Enter quantity of graph elements:"<>size; vertex *prev=new vertex(); vertex *root=new vertex(); vertex *current; root->createVertex(rand()%100,nullptr); prev->createVertex(rand()%100,root); int randSeed,randData; for(int i=0;i

binary graph