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

2 votes153 views2 answers
Python threading return value
Python
0 vote192 views1 answer
MULTIPLE Model Search in Django rest framework
Python Django
2 votes150 views2 answers
Label encoding
Python
0 vote158 views2 answers
Save gif python
Python
0 vote156 views1 answer
Write a python program which accepts the user
Python
0 vote152 views1 answer
Cube python
Python
0 vote157 views1 answer
Creating new column with dictionary
Python
5 votes167 views4 answers
Python save dictionary to file
Python
8 votes153 views4 answers
Df.drop index
Python
1 vote164 views1 answer
Division euclidienne python
Python