subtree

Examples

• All

• The sixteen subtrees are the sixteen trees for BT and BS, eight each.

  Academic text (2000)

• This can be done efficiently in a Kruskal-like way by building up a disjoint-set data structure to hold the two subtrees and sorting the remaining edges by weight: select the first one with endpoints in different sets.

  Blog text (34)

• OK, so in this subtree we do this.

• So really, Q should fit in the subtree between these two items.

• The eight subtrees are the eight trees for BT and BS, four each.

  Academic text (2000)

• The four subtrees are the four trees for BT and BS, two each.

  Academic text (2000)

• I implemented my parser as a regular old recursive-descent thing, where I do a depth-first search and stop searching a subtree after the first success.

  Blog text (8)

• Unreferencing a container causes the kernel to recursively unreference the entire subtree of objects rooted at that container.

  Academic text (2011)

• If its weight was increased, then delete it from the original MST and look for the lowest-weight edge that connects the two subtrees that remain (this could select the original edge again).

  Blog text (34)

• In a binary tree, each node has a left and a right subtree that represents smaller sections of the tree structure.

Surface Forms

Morphology

Etymology