Noun
subtree (plural subtrees)
(mathematics, computer science, graph theory) A tree wholly contained in another.
A black circle atop a triangle means that black-height of subtree is greater by one compared to subtree without this circle. Source: Internet
At each level, the search reduces its field of view to the child pointer (subtree) whose range includes the search value. Source: Internet
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). Source: Internet
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. Source: Internet
Each subtree could be empty, consist of a single node, or consist of any number of nodes. Source: Internet
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). Source: Internet