docs(data-structures): enables doc lint of data-structures (#4847)

_tools/check_docs.ts

@@ -30,6 +30,7 @@ const ENTRY_POINTS = [
   "../bytes/mod.ts",
   "../cli/mod.ts",
   "../collections/mod.ts",
+  "../data_structures/mod.ts",
   "../datetime/mod.ts",
   "../encoding/mod.ts",
   "../internal/mod.ts",

data_structures/binary_heap.ts

@@ -26,7 +26,7 @@ function getParentIndex(index: number) {
  * | pop()       | O(log n)     | O(log n)   |
  * | push(value) | O(1)         | O(log n)   |
  *
- * @example
+ * @example Usage
  * ```ts
  * import {
  *   ascend,

data_structures/binary_search_tree.ts

@@ -24,7 +24,7 @@ type Direction = "left" | "right";
  * | min()         | O(log n)     | O(n)       |
  * | max()         | O(log n)     | O(n)       |
  *
- * @example
+ * @example Usage
  * ```ts
  * import {
  *   BinarySearchTree,

data_structures/red_black_tree.ts

@@ -34,7 +34,7 @@ const {
  * | min()         | O(log n)     | O(log n)   |
  * | max()         | O(log n)     | O(log n)   |
  *
- * @example
+ * @example Usage
  * ```ts
  * import {
  *   ascend,
@@ -101,8 +101,6 @@ const {
  * @typeparam T The type of the values being stored in the tree.
  */
 export class RedBlackTree<T> extends BinarySearchTree<T> {
-  declare protected root: RedBlackNode<T> | null;
-
   /**
    * Construct an empty red-black tree.
    *