We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Very well done Felix!
Yeah, your are right. Your tree is not only slow, but lack functions such as size. These tests are also interestingly named:
size
#[test] fn tree_is_balanced() { //... assert_eq!(b, 0); } #[test] fn tree_is_really_balanced() { //... assert_eq!(b, 0); }
I would have liked you to instead have one test for assert_eq!(b, 0) and one for assert_eq!(b, 1).
assert_eq!(b, 0)
assert_eq!(b, 1)
Sad spagetti:
// get input lines as iterative //let lines: Vec<String> = input // .lock() // .lines() // .map(|_line| _line.ok().unwrap()) // .collect();
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Very well done Felix!
Yeah, your are right. Your tree is not only slow, but lack functions such as
size
. These tests are also interestingly named:I would have liked you to instead have one test for
assert_eq!(b, 0)
and one forassert_eq!(b, 1)
.Sad spagetti:
The text was updated successfully, but these errors were encountered: