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

39 votes256 views6 answers
Creating dataframe
Python
0 vote278 views1 answer
Herons rule python
Python
0 vote265 views1 answer
Compute Jordan normal form of matrix in Python / NumPy
Python
-1 vote276 views2 answers
Append multiple elements
Python
0 vote287 views1 answer
How to loop through pages of pdf using python
Python
0 vote272 views1 answer
How to save all countries from a list in a database python
Python
68 votes274 views5 answers
Python main method
Python
1 vote314 views1 answer
Python loop until condition met
Python
0 vote307 views1 answer
How to remove duplicate files from folder with python
Python
5 votes260 views2 answers
Turn df to dict
Python