// there is an issue in code.... custom == operator is not called from find method as we have vector of pointer and pointer is there as default data type for comparision of sort // you have to write own method to find node that would iterate on vector // refer below post and final solution there //https://www.sololearn.com/Discuss/2372217/?ref=app /* //Trying to find out whether tree is BST or not //Input is N as number of nodes //Later on lines (N-1) shows edges among nodes //Input 7 2 1 2 3 4 2 4 6 6 5 6 7 //output //BST */ using namespace std; #include #include #include struct Node { public: int data; bool HasLeft; int Leftdata; int Rightdata; bool HasRight; static bool AddEdge(vector&, int ,int); bool operator==(const Node*& obj) { if(this->data == obj->data) return true; else return false; } }; bool AddNewEntry(vector& input, int data,int newdata) { Node* curNode = new Node; curNode->data = data; if(dataHasLeft = true; curNode->HasRight = false; curNode->Leftdata = newdata; } else if(data>newdata) { curNode->HasRight = true; curNode->HasLeft = false; curNode->Rightdata = newdata; } else { return false; } input.push_back(curNode); return true; } bool Node::AddEdge(vector& input, int data,int newdata) { if(input.empty()) { cout << "Inside empty for " << data << " " << newdata << endl; return AddNewEntry(input,data,newdata); } else { Node* curNode = new Node; curNode->data = data; auto itr = find(input.begin(),input.end(),curNode); if(itr==input.end()) { cout << "Inside new entry for " << data << " " << newdata << endl; return AddNewEntry(input,data,newdata); } else { cout << "Inside existing entry for " << data << " " << newdata << endl; if(dataHasLeft == false) { (*itr)->HasLeft = true; (*itr)->Leftdata = newdata; } else if(data>newdata && (*itr)->HasRight == false) { (*itr)->HasRight = true; (*itr)->Rightdata = newdata; } else { return false; } } } return true; } int main(int argc, char *a[]) { int N; cin >> N; string str = "BST"; vector input; int data,newdata; for(int i=0;i> data >> newdata; bool isBST = Node::AddEdge(input,data,newdata); if(!isBST) str = "BT"; } cout << str; }

FindWhetherBSTorNot