def nright

import bend-collections@1.0.0.0/src/containers/balanced_search_tree.bend as BalancedSearchTree

import Base

92def nright(~K: Data, n: Node<K>) -> Nat:
93  match n:
94    case Free{x}:
95      0n
96    case N{c, l, r, p, k}:
97      r

Uses (2)