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 vote281 views1 answer
How to remove last character from a list in python
Python
5 votes286 views5 answers
Pass python
Python
0 vote337 views1 answer
How to create urls in django
Python Django
0 vote276 views1 answer
Dictionary multiple values per key
Python
0 vote278 views1 answer
Dict comprehensions
Python
1 vote286 views1 answer
Django group by date from datetime field
Python
0 vote290 views1 answer
Print nested dictionary values in python
Python
0 vote287 views1 answer
Azure functions read only file system
Python
58 votes288 views6 answers
String list to int list python
Python
3 votes282 views2 answers
Python discord webhook
Python