diff options
| author | mo khan <mo.khan@gmail.com> | 2020-07-19 13:35:49 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-07-19 13:35:49 -0600 |
| commit | f1e4b324321dc28ae8628727793b820d0edf7d2d (patch) | |
| tree | 136a3c8bf8284eb1af3aa98d5196088932954426 | |
| parent | 88f4bd74580e732a6720678661b3229238a6c78a (diff) | |
Add additional resources on scapegoat trees
| -rw-r--r-- | doc/unit/08/README.md | 6 | ||||
| -rw-r--r-- | src/02/03/btree_test.c | 1 |
2 files changed, 5 insertions, 2 deletions
diff --git a/doc/unit/08/README.md b/doc/unit/08/README.md index 4773186..8fe2849 100644 --- a/doc/unit/08/README.md +++ b/doc/unit/08/README.md @@ -1,4 +1,4 @@ -Chapter 8: Scapegoat Trees +# Chapter 8: Scapegoat Trees > when something goes wrong, the first thing people tend to do is find someone to blame (the scapegoat). @@ -21,3 +21,7 @@ At all times, `n` and `q` obey the following inequalities: > q/2 <= n <= q credit schema: Each node stores a number of credits. + +## Resources + +* http://people.csail.mit.edu/rivest/pubs/GR93.pdf diff --git a/src/02/03/btree_test.c b/src/02/03/btree_test.c index 8233ae5..8fb1254 100644 --- a/src/02/03/btree_test.c +++ b/src/02/03/btree_test.c @@ -70,7 +70,6 @@ Ensure(BinaryTree, when_inserting_multiple_items_into_a_tree_it_inserts_in_the_c assert_that(tree->left->right->left->data, is_equal_to(6)); } -// 1, 5, 2, 4, 3 is Ensure(BinaryTree, when_inserting_items_described_in_the_assignment_it_inserts_in_the_expected_position_in_the_tree) { BTree *tree = btree_insert(NULL, 1); tree = btree_insert(tree, 5); |