BinaryTree.cpp

#include <string>
#include <fstream>
#include <iostream>
#include <deque>
#include <iomanip>
#include <queue>
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include "BinaryTree.h"


;using namespace std;

//BinaryTree::BinaryTree(){ //Конструктор

//}

void BinaryTree::add_node(BinaryTree *tree, vector<int> str1){

    for(int i=0;i<str1.size();i++){
        if(tree==NULL){
            BinaryTree  *tree= new BinaryTree;
                tree->left=NULL;
                tree->right=NULL;
                tree->right= new BinaryTree;
                tree->left= new BinaryTree;
                tree->data=str1[i];
                cout<<endl;
                cout<<tree->data<<endl;
                if (tree->right==NULL) tree=tree->right;
                else if (tree->left==NULL) tree=tree->left;
        }else{

            if(str1[i]==tree->data){
                int j=i++;
                if((tree->left!=NULL)||(tree->right!=NULL)){
                    if ((str1[j]==tree->left->data)){
                        tree=tree->left;}
                    else if(str1[j]==tree->right->data) tree=tree->right;
                    }

                }
                        if (tree->right==NULL) tree=tree->right;
                        else if (tree->left==NULL) tree=tree->left;
            }
        }
    }
    /*int i=0;
    while(i<str1.size()){
        if((tree->data==str1[i])||(tree==NULL)){
            if(str1[i]==tree->data){
                i++;
                if ((str1[i]==tree->left->data)||(str1[i++]==tree->right->data)){
                    if  (str1[i++]==tree->left->data)
                        tree=tree->left;
                    else if(str1[i]==tree->right->data) tree=tree->right;
                }

                if (tree->right->data==NULL) tree=tree->right;
                else if (tree->left->data==NULL) tree=tree->left;
            }

            if(tree==NULL){
                tree= new BinaryTree;
                tree->right= new BinaryTree;
                tree->left= new BinaryTree;
                tree->left=NULL;
                tree->right=NULL;
                tree->data=str1[i];
                i++;

            }
        } else cout<<" oshibka vvoda"<< endl;
        i++;
    }*/

    //  cout<<tree->left<<endl;