Width of the tree at each level of tree depth, starting with the root at breadth[0].
A deep tree with relatively small breadth values may benefit from being balanced.
True if the tree structure is compacted.
The maximum depth (height) of the tree.
The greatest code point contained in any string in the set.
The least code point contained in any string in the set.
The total number of nodes in the tree. For a typical JavaScript engine,
the set will consume approximately nodes * 16 bytes of memory,
plus some fixed object overhead.
The number of strings in the tree. Equivalent to the size property.
The total number of nodes whose code point spans multiple char codes when stored in a string.
Returns the stats in string form.
Generated using TypeDoc
Tree structure information obtained by reading the
statsproperty.