z11h
/ binarySearchTree.py
Created
July 16, 2019 22:09
— forked from jakemmarsh/binarySearchTree.py
a simple implementation of a Binary Search Tree in Python
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 Node: | |
| def __init__(self, val): | |
| self.val = val | |
| self.leftChild = None | |
| self.rightChild = None | |
| def get(self): | |
| return self.val | |
| def set(self, val): |