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

4 votes273 views4 answers
Pointer
C++
0 vote218 views1 answer
Are arrays faster than vectors c++
C++
3 votes294 views3 answers
Largest Subarray with Zero Sum
C++
0 vote368 views1 answer
Why constructor can't be static in c++
C++
0 vote248 views1 answer
ViewController import
C++
2 votes253 views2 answers
Back() in c++
C++
12 votes221 views1 answer
Create copy constructor c++
C++
0 vote223 views1 answer
Full implementation of binary search tree in C++
C++
0 vote231 views1 answer
C++ delete int
C++
7 votes267 views2 answers
Round c++
C++