Aruan set options binary search tree

use is to implement sets and tables (dictionaries, mappings). As shown on. 1. AVL trees. Binary search trees in which the two children of each node differ in height by at. join(L, m, R): BST× (key× data) option× BST → BST. This function takes.