branching tree

  • 71bronchial tree — n the bronchi together with their branches * * * a branching system of tubes conducting air from the trachea (windpipe) to the lungs: includes the bronchi (see bronchus) and their subdivisions and the bronchiole. * * * arbor bronchialis …

    Medical dictionary

  • 72Jesse tree — noun a representation of the genealogy of Jesus as a tree with Jesse (the father of King David) at the base and intermediate descendants on branching scrolls of foliage …

    English new terms dictionary

  • 73clothes tree — ☆ clothes tree n. an upright pole with branching hooks or pegs near the top to hold coats and hats …

    English World dictionary

  • 74dendritic tree — the branching arrangement of a dendrite …

    Medical dictionary

  • 75Joshua tree — noun a tall branching yucca of SW North America, with clusters of spiky leaves. [Yucca brevifolia.] Origin C19: appar. from Joshua (Josh. 8:18), the plant being likened to a man with a spear …

    English new terms dictionary

  • 76bronchial tree — noun the branching system of bronchi and bronchioles, conducting air from the windpipe into the lungs …

    English new terms dictionary

  • 77bronchial tree — a branching system of tubes conducting air from the trachea (windpipe) to the lungs: includes the bronchi (see bronchus) and their subdivisions and the bronchioles …

    The new mediacal dictionary

  • 78California tree poppy — noun tall branching subshrub of California and Mexico often cultivated for its silvery blue foliage and large fragrant white flowers • Syn: ↑matilija poppy, ↑Romneya coulteri • Hypernyms: ↑subshrub, ↑suffrutex • Member Holonyms: ↑Romneya, ↑ …

    Useful english dictionary

  • 79Metrical phonology — is a theory of stress or linguistic prominence.[1] [2] The innovative feature of this theory is that the prominence of a unit is defined relative to other units in the same phrase. For example, in the most common pronunciation of the phrase… …

    Wikipedia

  • 80König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …

    Wikipedia