insert binary search tree
void BSNode::insert(std::string value) { if (this->_data == value) { _count++; return; } if (this->_data > value) { if (this->getLeft() == nullptr) { this->_left = new BSNode(value); } this->getLeft()->insert(value); return; } if (this->getRight() == nullptr) { this->_right = new BSNode(value); return; } this->getRight()->insert(value); }