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 votes172 views1 answer
Binomial coefficient python
Python
4 votes188 views3 answers
How to convert a list into a dataframe in python
Python
3 votes178 views1 answer
Join two set in python
Python
-1 vote185 views1 answer
Django template filter
Python
2 votes169 views1 answer
Django group with permission
Python
1 vote177 views1 answer
Current date to epoch python
Python
10 votes197 views2 answers
Python list to set
Python
21 votes191 views2 answers
Python extract substring
Python
2 votes178 views8 answers
Codegrepper
Python
51 votes171 views6 answers
Python remove repeated elements from list
Python