Binary search tree in python

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

Binary tree in python

Binary Tree implementation at this link:
  
https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/BinaryTrees

Binary search tree in python

Binary Search Tree at this link:
  
https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/BinaryTrees

Binary search in python

def binary_search(group, suspect):
  group.sort()
  midpoint = len(group)//2
  while(True):
    if(group[midpoint] == suspect):
      return midpoint
    if(suspect > group[midpoint]):
            group = group[midpoint]
    if(suspect < group[midpoint]):
      group = group[0: midpoint]
    midpoint = (len(group)//2)

Similar codes

1 vote338 views3 answers
Tabula python
Python
1 vote302 views1 answer
Simple trivia question python
Python
0 vote382 views1 answer
Django filter queryset by date
Python Django
-1 vote298 views1 answer
Web browser api python
Python
219 votes684 views6 answers
Random number python
Python
20 votes338 views6 answers
Python download file from url
Python
0 vote347 views1 answer
Pyplot savefig
Python
1 vote326 views1 answer
Url decode python
Python
1 vote320 views1 answer
Handler.setLevel(logging.DEBUG) not working python
Python
0 vote336 views1 answer
Get return value from transaction in brownie
Python