binary tree


A special type of tree structure in which each node has at most two leaves. Binary tree are often used for sorting data, as in a heap sort.

Read Also:

  • bind

    (1) To assign a value to a symbolic placeholder. During compilation, for example, the compiler assigns symbolic addresses to some variables and instructions. When the program is bound, or linked, the binder replaces the symbolic addresses with real machine addresses. The moment at which binding occurs is called bind time or link time. (2) When […]

  • binder

    (1) A tool that combines two or more files into a single file, usually for the purpose of hiding one of them. Commonly associated with Trojan horses, where the Trojan is bound to a real file, such as a text file that opens with Notepad or other program. The users believe they are opening a […]

  • binning

    In biometrics it is the term used to describe the examination or classification of biometric data to improve a biometric engine’sidentification matching rate.

  • bioidentification

    Slang term used to mean identification based on biometrics. May also be called bio-identification.

  • bioinformatics

    The application of computer technology to the management of biological information. Specifically, it is the science of developing computer databases and algorithms to facilitate and expedite biological research. Bioinformatics is being used largely in the field of human genome research by the Human Genome Project that has been determining the sequence of the entire human […]


Disclaimer: binary tree definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.