flashcasts about account

Define a doubly linked list.

Define Dijkstra's algorithm.

Differentiate between adjacency list and adjacency matrix representations of a graph.

Define the Boyer-Moore algorithm.

Explain Breadth-first search (BFS) in tree traversal.

Define interval trees.

Define linear probing in the context of open addressing.

Define amortized analysis in the context of algorithm complexity.

Define the concept of an exponential tree.

Define a graph vertex.

Define a quadtree.

Differentiate between a directed and undirected graph.

Define a trie (prefix tree).

Define a segment tree.

Define a union by rank and path compression in disjoint-set data structures.

Define a k-d tree (k-dimensional tree).

Define a dense graph.

Define a hash function in the context of hash tables.

Define the concept of a persistent data structure.

Define a weighted graph.

Explain the A* search algorithm.

Define a complete binary tree.

Define a priority queue.

Explain dynamic programming in relation to data structures.

Define AVL tree.