Data and Math

vtree

Binary search trees and tries, built from shapes that point at each other.

Released v1.0.0 · 2026-09-28

Import

use "stdlib/tree.ven"

vtree.ven

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
print bst_in_order(root)

Reference (12 functions)

API reference

Inserts value into the binary search tree rooted at node.

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
bst_in_order(root)

Tests whether value exists anywhere in the tree rooted at node.

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
bst_contains(root, 2)

Gives back every value in the tree rooted at node, sorted ascending.

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 1)
root = bst_insert(root, 3)
bst_in_order(root)

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
root = bst_insert(root, 8)
bst_min_node(root).value

Removes value from the tree rooted at node, if present.

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
root = bst_insert(root, 8)
root = bst_remove(root, 5)
bst_in_order(root)

Gives back the height of the tree rooted at node.

root = nothing
root = bst_insert(root, 5)
root = bst_insert(root, 2)
root = bst_insert(root, 8)
bst_height(root)

Builds a new, empty trie.

trie_new()

Inserts word into the trie rooted at root.

t = trie_new()
trie_insert(t, "cat")
trie_contains(t, "cat")

t = trie_new()
trie_insert(t, "cat")
trie_find_node(t, "ca") == nothing

Tests whether word was inserted into the trie rooted at root.

t = trie_new()
trie_insert(t, "cat")
trie_contains(t, "ca")

Collects every complete word reachable from node into result.

t = trie_new()
trie_insert(t, "cat")
trie_insert(t, "car")
trie_collect_words(t, "", [])

Gives back every inserted word that starts with prefix.

t = trie_new()
trie_insert(t, "cat")
trie_insert(t, "car")
trie_insert(t, "dog")
trie_words_with_prefix(t, "ca")