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 vote172 views1 answer
How to play sounds in c++
C++
1 vote187 views1 answer
Heap c++ stl
C++
2 votes179 views2 answers
Copy array c++
C++
4 votes181 views1 answer
How to check if a value is inside an array in c++
C++
0 vote179 views4 answers
C++ sort vector of objects by property
C++
1 vote221 views1 answer
What are specialized classes c++
C++
9 votes133 views1 answer
C++ read file to string
C++
1 vote185 views1 answer
Implementation of Extended Euclidian theorem
C++
1 vote203 views1 answer
Restting a queue stl
C++
10 votes201 views3 answers
Conditional operator in c++
C++