From 87759c28d134a52690f1adf09325e333624f9d23 Mon Sep 17 00:00:00 2001 From: sgoudham Date: Thu, 24 Feb 2022 04:21:38 +0000 Subject: [PATCH] Update docs --- src/lib.rs | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) diff --git a/src/lib.rs b/src/lib.rs index 44876c9..4e8ada1 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -14,7 +14,7 @@ //! //! That being said, there are some areas I would love to improve upon/include: //! - Write idiomatic code. -//! - Effectively use macros to reduce large portions of repetitive code. +//! - Effectively use [macro_rules!] to reduce large portions of repetitive code. //! - Implement a **pretty_print()** function to display the binary search trees nicely. //! - Implement [Drop] trait for iterative node cleanup. //! - Pre-allocate space on the heap for nodes to reduce inefficiency of inserts. @@ -356,8 +356,7 @@ pub trait BinarySearchTree { fn into_level_order_iter(self) -> IntoIter; } -/// A Recursive Binary Search Tree implementation, defined as `RecursiveBST` where T _must_ -/// implement trait [Ord]. +/// Recursive Binary Search Tree implementation. /// /// # Important /// @@ -372,8 +371,7 @@ pub struct RecursiveBST { size: usize, } -/// An Iterative Binary Search Tree implementation, defined as `IterativeBST` where T _must_ -/// implement trait [Ord]. +/// Iterative Binary Search Tree implementation. /// /// # Important ///