/konz/ or /kons/ [LISP, "construct"] A Lisp function which takes an element H and a list T and returns a new list whose head is H and whose tail is T. In Lisp, "cons" is the most fundamental operation for building structures. It actually takes any two objects and returns a "dotted-pair" or two-branched tree with one object hanging from each branch. Because the result of a cons is an object, it can be used to build binary trees of any shape and complexity. [Jargon File]

In addition suitable contents:
[ = ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ at ] [ au ] [ B ] [ b ] [ be ] [ bi ] [ binary ] [ binary tree ] [ bj ] [ br ] [ branch ] [ ca ] [ ch ] [ co ] [ com ] [ complexity ] [ con ] [ ding ] [ do ] [ dot ] [ du ] [ ec ] [ ed ] [ ee ] [ element ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ function ] [ gi ] [ h ] [ hang ] [ hose ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ IS ] [ is ] [ ISP ] [ it ] [ J ] [ Jargon File ] [ ke ] [ ld ] [ Lex ] [ li ] [ LIS ] [ Lisp ] [ list ] [ lt ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ ns ] [ nz ] [ object ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ S ] [ se ] [ sh ] [ SP ] [ st ] [ struct ] [ su ] [ T ] [ th ] [ to ] [ tr ] [ tree ] [ tt ] [ tw ] [ ua ] [ us ]