Explore Subtree through 10+ example sentences from English, with an explanation of the meaning. Ideal for language learners, writers and word enthusiasts.
Subtree meaning
A tree wholly contained in another.
Using Subtree
- The main meaning on this page is: A tree wholly contained in another.
- In the example corpus, subtree often appears in combinations such as: the subtree, subtree is, of subtree.
Context around Subtree
- Average sentence length in these examples: 24.7 words
- Position in the sentence: 4 start, 7 middle, 2 end
- Sentence types: 13 statements, 0 questions, 0 exclamations
Corpus analysis for Subtree
- In this selection, "subtree" usually appears in the middle of the sentence. The average example has 24.7 words, and this corpus slice is mostly made up of statements.
- Around the word, left, pointer, side, decreases and used stand out and add context to how "subtree" is used.
- Recognizable usage signals include a subtree of a and a subtree s range. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "subtree" sits close to words such as aanand, abcd and abdurrahman, which helps place it inside the broader word index.
Example types with subtree
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
If the key is less than that of the root, we search the left subtree. (15 words)
A subtree's range is defined by the values, or keys, contained in its parent node. (16 words)
Similarly, if the key is greater than that of the root, we search the right subtree. (16 words)
A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.This is different from the formal definition of subtree used in graph theory, which is a subgraph that forms a tree – it need not include all descendants. (49 words)
Given a node in a tree, its children define an ordered forest (the union of subtrees given by all the children, or equivalently taking the subtree given by the node itself and erasing the root). (35 words)
As with all binary trees, a node's in-order successor is its right subtree's left-most child, and a node's in-order predecessor is the left subtree's right-most child. (34 words)
Example sentences (13)
When a subtree is rotated, the subtree side upon which it is rotated increases its height by one node while the other subtree decreases its height.
A black circle atop a triangle means that black-height of subtree is greater by one compared to subtree without this circle.
A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.This is different from the formal definition of subtree used in graph theory, which is a subgraph that forms a tree – it need not include all descendants.
As with all binary trees, a node's in-order successor is its right subtree's left-most child, and a node's in-order predecessor is the left subtree's right-most child.
A subtree's range is defined by the values, or keys, contained in its parent node.
At each level, the search reduces its field of view to the child pointer (subtree) whose range includes the search value.
Each subtree could be empty, consist of a single node, or consist of any number of nodes.
For example, the root node by itself is a subtree in the graph theory sense, but not in the data structure sense (unless there are no descendants).
Given a node in a tree, its children define an ordered forest (the union of subtrees given by all the children, or equivalently taking the subtree given by the node itself and erasing the root).
If the key is less than that of the root, we search the left subtree.
Note, however, that phrases can still be acknowledged insofar as any subtree that contains two or more words will qualify as a phrase.
Similarly, if the key is greater than that of the root, we search the right subtree.
That is, at each node of the tree, one may consider the subtree to the left or to the right.
Common combinations with subtree
These word pairs occur most frequently in English texts:
- the subtree 3×
- subtree is 2×
- of subtree 2×