Created
April 24, 2019 15:14
-
-
Save DiegoGallegos4/9da3945efa8011d489abe691a36aa328 to your computer and use it in GitHub Desktop.
Binary Search Tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class TreeNode: | |
def __init__(self, key, parent=None, left=None, right=None): | |
self.key = key | |
self.parent = parent | |
self.left = left | |
self.right = right | |
class BinarySearchTree: | |
def __init__(self): | |
self.root = None | |
self.size = 0 | |
def __len__(self): | |
return self.size | |
def __iter__(self): | |
return self.root.__iter__() | |
def find(self, key): | |
if self.root: | |
return self._find(key, self.root) | |
return None | |
def _find(self, key, current): | |
if not current: | |
return None | |
elif current.key == key: | |
return current | |
elif key < current.key: | |
if current.left: | |
return self._find(key, current.left) | |
return current | |
else: | |
if current.right: | |
return self._find(key, current.right) | |
return current | |
def insert(self, key): | |
if self.root: | |
return self._insert(key, self.root) | |
else: | |
self.root = TreeNode(key) | |
self.size += 1 | |
def _insert(self, key, current): | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment