ADS Logs

dequeue() → 5, dequeue() → 3, first() → 7, dequeue() → 7, and the last dequeue() → null because the queue is empty. * dequeue always takes the oldest element still waiting. * Operation Returns Queue (front … rear) enqueue(5) — (5) enqueue(3) — (5, 3) dequeue() 5 (3)...

Quiz: ADS / Linear Data Structures: Lists, Stacks, Queues, Deques, Iterators | updated: Sep 29, 2026

Ancestors are a node's parent, grandparent and so on up to the root; descendants are its children, grandchildren and so on; siblings share the same parent; a subtree is a node together with all of its descendants. Take the tree where A has children B, C, D; B has children E, F; a...

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

Each node stores four references: its element, its parent, its left child and its right child. The general tree's sequence of children is replaced by exactly two fixed fields. * Solid arrows point down to the children, dashed ones back up to the parent; ∅ marks a missing child....

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

Preorder A B D E C F · inorder D B E A C F · postorder D E B F C A · breadth-first A B C D E F. * C has only a right child, so F comes after C in inorder. * * Same tree, four orders; the leaves D, E, F keep their relative order in the first three. * Work each one out from its r...

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

An ADT describes a data structure by what it does, not how: it specifies the data it stores, the operations on that data, and the error conditions of those operations, while leaving the implementation open. An ADT specification has three parts: Data — what is stored (the attribu...

Quiz: ADS / Linear Data Structures: Lists, Stacks, Queues, Deques, Iterators | updated: Sep 29, 2026

Wherever things must be handled in arrival order: waiting lines, shared resources such as a printer, and scheduling in multiprogramming and multithreading; indirectly as helper structures in other algorithms and data structures. Direct applications — all of them "first come, firs...

Quiz: ADS / Linear Data Structures: Lists, Stacks, Queues, Deques, Iterators | updated: Sep 29, 2026

The depth of a node is the number of its ancestors (not counting itself), which equals the number of edges on the path up to the root; the root has depth 0, and every other node has depth 1 + the depth of its parent. The definition gives a recursive algorithm directly: Algorithm...

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

Each node is stored at the index given by its rank: the root has rank 1, the left child of the node at $k$ has rank $2k$, the right child $2k + 1$. The parent of the node at $k$ is therefore at $\lfloor k/2 \rfloor$. Index 0 is left empty. * The rank of each node is its array in...

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

With a specialised inorder traversal: print "(" before traversing a node's left subtree, print the node's operator or operand when visiting it, and print ")" after traversing its right subtree. The tree for $((2 × (a − 1)) + (3 × b))$ prints exactly that string. * Operators are...

Quiz: ADS / Trees: Structure, Storage and Traversals | updated: Sep 29, 2026

A stack stores objects in last-in, first-out (LIFO) order: push(o) puts an element on top, pop() removes and returns the top element. Helper operations are top() (look without removing), size() and isEmpty(). Picture a stack of plates: you can only put a plate on top and only tak...

Quiz: ADS / Linear Data Structures: Lists, Stacks, Queues, Deques, Iterators | updated: Sep 29, 2026