/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]

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]