diff options
| author | mo khan <mo.khan@gmail.com> | 2020-09-26 19:39:48 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-09-26 19:39:48 -0600 |
| commit | 36d01edd61921f98a81ffabbc6abac3cf4503381 (patch) | |
| tree | 61f8e4fc7cb1bd42838d4b73db616150764b2f84 /src/03/matrix_test.c | |
| parent | b1efa9cd26f037f8b7fa6e38ca1ccd9064093f39 (diff) | |
feat: prove that height of binary tree is greater than or equal to log2(k) where k is the # of leaves in the tree
Diffstat (limited to 'src/03/matrix_test.c')
| -rw-r--r-- | src/03/matrix_test.c | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/src/03/matrix_test.c b/src/03/matrix_test.c index 0958df7..9397070 100644 --- a/src/03/matrix_test.c +++ b/src/03/matrix_test.c @@ -24,9 +24,8 @@ Ensure(every_edge_is_traversed_in_both_directions_at_least_once) { {0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0}, }; - matrix_inspect(n, graph); matrix_traverse(n, graph, visited, 0); - matrix_inspect(n, graph); + printf("\n"); for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) |