def mk_node
import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTreeimport Base
113def mk_node(~K: Data, +t: Nat, +l: Nat, +r: Nat, +p: Nat, k: Maybe<&2, K>) -> Node<K>:
114 match t k:
115 case 0n _:
116 Free{l}
117 case 1n+ +c Some{key}:
118 N{Nat.is_eq(c, 1n), l, r, p, key}
119 case 1n+ +c None{}:
120 Free{l}