The Blooming Tree (BT) algorithm identifies clusters, groups, and substructures from galaxy redshift surveys. Based on the hierarchical clustering method, it takes the projected binding energy as the linking length and provides three main analysis approaches to trim the hierarchical tree; 1.) the direct trimming (binding energy, velocity disperion, or eta); 2.) the sigma plateau, when no trimming threshold is appointed; and 3.) the blooming tree. The Blooming Tree algorithm tool works only in the terminal.