Module python_datastructures.binarySearchTree

Binary search tree, also called an ordered or sorted binary tree (BST), is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

Classes

class BST

Methods

def add(self, value: ~T)

def build(self, array: list) ‑> NoneType

def contains(self, value)

def getOrder(self, order='inOrder')

def isValid(self)

def minValueNode(self, node)

def remove(self, value)

class Node (value: ~T)