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

10 votes203 views1 answer
Python game engine
Python
26 votes184 views4 answers
Python global variables
Python
0 vote166 views1 answer
Python set match two list
Python
5 votes186 views2 answers
Making variable if it is none python
Python
0 vote232 views1 answer
Python googledriver download
Python
1 vote167 views1 answer
Index of max in tensor
Python
3 votes160 views2 answers
Python If ... Else
Python
-1 vote151 views1 answer
Python how to make a user input function
Python
0 vote192 views1 answer
Extends template django file system
Python
1 vote170 views1 answer
Accessing index of dataframe python
Python