Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A height-balanced tree which is also a binary search tree. It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)48 45 49 47 48 54 2D 42 41 4C 41 4E 43 45 44 42 49 4E 41 52 59 53 45 41 52 43 48 54 52 45 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001000 01000101 01001001 01000111 01001000 01010100 00101101 01000010 01000001 01001100 01000001 01001110 01000011 01000101 01000100 00100000 01000010 01001001 01001110 01000001 01010010 01011001 00100000 01010011 01000101 01000001 01010010 01000011 01001000 00100000 01010100 01010010 01000101 01000101 |
HTML Code (1990) (references)H E I G H T - B A L A N C E D   B I N A R Y   S E A R C H   T R E E |
ISO 10646 (1991-1993) (references)0048 0045 0049 0047 0048 0054 002D 0042 0041 004C 0041 004E 0043 0045 0044 0042 0049 004E 0041 0052 0059 0053 0045 0041 0052 0043 0048 0054 0052 0045 0045 |
Encryption (beginner's substitution cypher): (references)42394341425415363546354837393823643483552592533935523742254523939 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
