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 vote127 views1 answer
Change freq of date index in pandas
Python
0 vote105 views1 answer
Max deviation in pandas
Python
0 vote113 views1 answer
Icon tkiner
Python
0 vote107 views1 answer
Jhon wick
Python
0 vote102 views3 answers
Automatic trace table make
Python
1 vote114 views1 answer
Loss funfction suited for softmax
Python
0 vote216 views1 answer
Python devops modules
Python
0 vote140 views1 answer
Django update replace regex
Python Django
0 vote112 views1 answer
Jupyter notebook for pdf generation
Python
37 votes112 views1 answer
Get current date datetime
Python