In a typeless language such as BCPL, data structures may easily be defined by means of an indirection operator. This useful way of defining data structures is here extended so as to apply to a type-rich language. Each structure is defined by its structure graph, which is built at complile-time according to certain rules that are explained. A structure built in this way is called a hybrid data structure. Examples are given to show how these structures may be used in programming.