[Page 1035 (continued)]Terminology
binary search tree binary tree binary tree sort child node circular, doubly linked list circular, singly linked list data structure delegation dequeue doubly linked list duplicate elimination dynamic data structures enqueue firstin, firstout (FIFO) head of a queue inorder traversal of a binary tree inserting a node lastin, firstout (LIFO) leaf node left child left subtree levelorder traversal linear data structure link linked list node nonlinear data structure parent node [Page 1036]pointer link pop postorder traversal of a binary tree preorder traversal of a binary tree print spooling push queue right child right subtree root node selfreferential structure siblings singly linked list spooler stack tail of a queue top of a stack
