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

0 vote300 views1 answer
Const in c++ is same as globle in python
C++
0 vote278 views1 answer
C++ typeid get type name
C++
1 vote266 views1 answer
Differency between c++ std and stl
C++
0 vote287 views1 answer
Hamming c++
C++
0 vote289 views1 answer
Memset array bool
C++
19 votes277 views6 answers
Rand() c++
C++
2 votes251 views1 answer
Final in c++
C++
-2 votes297 views4 answers
Function Template in c++
C++
1 vote282 views1 answer
Can you chnage the address of a pointer
C++
0 vote277 views3 answers
C++ tuple
C++