1.0.0
These are the exported data structures.
(any)
Type: TTreeNode?
Inserts a key with the provided value into the tree. If the key is already present it will replace the old value with the new one.
BinarySearchTree
Attempts to find node with the min key in the tree.
(TTreeNode?
= this.root
)
TTreeNode?
Attempts to find node with the max key in the tree.
(TTreeNode?
= this.root
)
TTreeNode?
(TTreeNode)
(TTreeNode?)
void
Type: LinkedListNode?
Inserts the value into a node at the end of the list, recursively.
(any)
(LinkedListNode?
= this.head
)
LinkedList
Inserts the value into a node with a specific position in the list.
(any)
(number)
LinkedList
Inserts the value into a node at the beginning of the list, as the head.
(any)
LinkedList
Returns the first node with a value matching that provided.
(any)
LinkedListNode?
Deletes the the first node with the value provided, returning the value deleted.
(any)
any
These are non-exported data structures that are used internally.
(number)
(any)
Type: any
Type: BinarySearchTreeNode?
Type: BinarySearchTreeNode?
Type: BinarySearchTreeNode?
(any)
Type: any
Type: LinkedListNode?