In the context
of computer science
(specifically the binary tree data structure
) bushy refers to a tree in which most nodes have their full load of children. (In the case of a binary tree, this is two)
Having bushy trees is nice for tree operations
as the more bushy a binary or other type of search tree is, the faster the operation can be completed.