From c509a2d640538052a3b75de3c49465e1961e3e70 Mon Sep 17 00:00:00 2001
From: Revone <zrwusa@gmail.com>
Date: Tue, 7 Nov 2023 20:08:16 +0800
Subject: [PATCH] [test] trying to test RedBlackTree

---
 package.json                                     |  2 +-
 .../data-structures/binary-tree/rb-tree.test.ts  | 16 ++++++++++++++++
 2 files changed, 17 insertions(+), 1 deletion(-)

diff --git a/package.json b/package.json
index f3b8678..8617e9e 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.42.3",
+  "version": "1.42.4",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/cjs/src/index.js",
   "module": "dist/mjs/src/index.js",
diff --git a/test/unit/data-structures/binary-tree/rb-tree.test.ts b/test/unit/data-structures/binary-tree/rb-tree.test.ts
index 8e85b34..afa2202 100644
--- a/test/unit/data-structures/binary-tree/rb-tree.test.ts
+++ b/test/unit/data-structures/binary-tree/rb-tree.test.ts
@@ -447,6 +447,13 @@ describe('RedBlackTree', () => {
       82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92,
       93, 94, 95, 96, 97, 98, 99
     ])
+    expect(tree.dfs( n => n.key, "in", tree.root, IterationType.RECURSIVE)).toEqual([
+      49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+      60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,
+      71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
+      82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92,
+      93, 94, 95, 96, 97, 98, 99
+    ])
   });
 
   it('should fix the tree after large scale insertion and deletion', () => {
@@ -460,6 +467,15 @@ describe('RedBlackTree', () => {
     expect(tree.size).toBe(0);
     expect(tree.isBST()).toBe(true);
     expect(tree.dfs( n => n.key, "in", tree.root, IterationType.ITERATIVE)).toEqual([])
+
+    tree.clear();
+    for (let i = 0; i < 1000; i++) {
+      tree.add(getRandomInt(-100, 1000))
+      tree.delete(getRandomInt(-100, 1000))
+    }
+
+    // TODO there is a bug when dfs the tree with NIL node
+    // expect(tree.isBST()).toBe(true);
   });
 
 });