In almost all programming languages, what kind of bracketing is used to denote array access?

Most often, to save a string into memory, you just put it in ___

A string ends with the binary value 0 in memory, which is called ___

What is the operation of joining character strings end-to-end called?

A two-dimensional list, which can be thought of as an array of arrays, is called ___

A data type that can be used to group items of possibly different types into a single type is called ___

A type of struct that stores a variable, like a number, and also a pointer is called ___

A flexible data structure that can store many nodes is called ___

Complex data structures built on top of linked lists, that use First-In First-Out behaviour, are called ___

When linked lists are used as stacks, what kind of behaviour is implemented?

Instead of enqueuing and dequeuing, data is pushed onto a stack and ___

If a struct contains more than one pointer, what abstract data type is created?

In a tree data structure, the top most node is called ___

In a tree data structure, any nodes that hang from other nodes are called ___

In a tree data structure, any nodes that have no children (where the tree ends) are called ___

An important property of trees is that there’s a one-way path from ___

Which data structure is used for data that links arbitrarily, and includes things like loops?