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);
}

Similar codes

3 votes146 views2 answers
Fast Inverse Square Root
C++
0 vote153 views1 answer
Gamemaker studio
C++
6 votes183 views2 answers
What is throw in c++
C++
1 vote160 views1 answer
Ue4 spawn actor c++
C++
1 vote151 views1 answer
Cout char32_t c++
C++
0 vote150 views1 answer
C++ execution time
C++
0 vote191 views1 answer
For statement in c++
C++
1 vote130 views1 answer
How to get double y dividing 2 integers in c++
C++
23 votes137 views2 answers
C++ user input
C++
0 vote145 views1 answer
How to play sounds in c++
C++