Definitions from Wikipedia (Weight-balanced tree)

▸ noun:  In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences.


▸ Words similar to weight-balanced tree
▸ Usage examples for weight-balanced tree

▸ Idioms related to weight-balanced tree
▸ Wikipedia articles (New!)
▸ Words that often appear near weight-balanced tree
▸ Rhymes of weight-balanced tree

▸ Invented words related to weight-balanced tree