Quotes from the Data Structures Instructional Videos

Yoda -- To Luke, lamenting a lack of proper data structure preparation:

"Do. Or do not. There is no trie."

(From Jim) Obi-Wan Kenobi -- To Luke, on the dangers of coding B-Trees:

"No, wait Luke -- it's too dangerous!"

(From Jim) Darth Vader -- Predicting an imminent core dump:

"I feel something. A presence I've not felt since..."

(From Rachel) Storm Trooper -- On the problems with inserts in unorthodox B-Trees with internal data:

"We think they've split up. They're on levels five and six now."

Darth Vader -- On being questioned about the linear worst case of splay trees:

"I find your lack of faith disturbing."

Darth Vader -- On AVL vs. Splay Trees:

"Don't be too proud of this balanced tree you've constructed. The ability to search in guaranteed log n time is insignificant compared to the power of locality."

Darth Vader -- On poor performance of generic hash functions with patterned data:

"Their resistance to the hash function is considerable. It will be some time before we can extract any information from them."

Darth Vader -- On circular array implementations of queues:

"I've been waiting for you, head pointer. We meet again, at last. The circle is now complete."

Darth Vader -- On splaying:

"When I left you, I was but a leaf; now I am the root node."

Darth Vader -- On finding the minimum in a hash table:

"Tear this data structure apart until you've found that minimum and bring me its value. I want it alive!"

Darth Vader -- On quadratic probing in hash tables with a load factor of more than 0.5:

"Don't fail me again."

Darth Vader -- More on the quadratic probing...:

"You have failed me for the last time."

Darth Vader -- On the difficulties of deletion in closed hashing:

"Lazy deleted nodes do not concern me, Admiral. I want that key and not excuses."

Darth Vader -- On highly unbalanced branches of splay trees:

"If it could be rotated, it would become a powerful ally."

Darth Vader -- On adoptions in B-Trees:

"We would be honored if you would join us."

Darth Vader -- On performance degradation during rehashing:

"It will not be permanently damaged."

Darth Vader -- On nodes which fall deep in a BST:

"Perhaps you think you're being treated unfairly."

Darth Vader -- On rehashing of static data for pre-constructed hash tables:

"I am altering the hash function. Pray I don't alter it any further."

Darth Vader -- On fortunate best case finds in AVL trees:

"All too easy. Perhaps you are not as deep as the Emperor thought."