From 1a0bb945339749572a46633e7e9e8e8a901fa5b2 Mon Sep 17 00:00:00 2001
From: Eyas Ranjous <eyas.ranjous@gmail.com>
Date: Wed, 13 Oct 2021 00:24:58 -0500
Subject: [PATCH 1/2] ts types

---
 src/avlTree.d.ts              | 16 ++++++++--------
 src/binarySearchTree.d.ts     | 16 ++++++++--------
 src/binarySearchTreeNode.d.ts | 14 +++++++-------
 3 files changed, 23 insertions(+), 23 deletions(-)

diff --git a/src/avlTree.d.ts b/src/avlTree.d.ts
index 3bed1cd..8ea719b 100644
--- a/src/avlTree.d.ts
+++ b/src/avlTree.d.ts
@@ -3,14 +3,14 @@ import { AvlTreeNode } from './avlTreeNode';
 
 export class AvlTree<T extends number|string, U = undefined> extends BinarySearchTree<T, U> {
   insert(key: T, value?: U): AvlTreeNode<T, U>;
-  find(key: T): AvlTreeNode<T, U>;
-  max(node?: AvlTreeNode<T, U>): AvlTreeNode<T, U>;
-  min(node?: AvlTreeNode<T, U>): AvlTreeNode<T, U>;
-  lowerBound(k: T, includeEqual?: boolean): AvlTreeNode<T, U>;
-  floor(k: T, includeEqual?: boolean): AvlTreeNode<T, U>;
-  upperBound(k: T, includeEqual?: boolean): AvlTreeNode<T, U>;
-  ceil(k: T, includeEqual?: boolean): AvlTreeNode<T, U>;
-  root(): AvlTreeNode<T, U>;
+  find(key: T): AvlTreeNode<T, U> | null;
+  max(node?: AvlTreeNode<T, U>): AvlTreeNode<T, U> | null;
+  min(node?: AvlTreeNode<T, U>): AvlTreeNode<T, U> | null;
+  lowerBound(k: T, includeEqual?: boolean): AvlTreeNode<T, U> | null;
+  floor(k: T, includeEqual?: boolean): AvlTreeNode<T, U> | null;
+  upperBound(k: T, includeEqual?: boolean): AvlTreeNode<T, U> | null;
+  ceil(k: T, includeEqual?: boolean): AvlTreeNode<T, U> | null;
+  root(): AvlTreeNode<T, U> | null;
   traverseInOrder(cb: (node: AvlTreeNode<T, U>) => void): void;
   traversePreOrder(cb: (node: AvlTreeNode<T, U>) => void): void;
   traversePostOrder(cb: (node: AvlTreeNode<T, U>) => void): void;
diff --git a/src/binarySearchTree.d.ts b/src/binarySearchTree.d.ts
index 9c981b0..4577605 100644
--- a/src/binarySearchTree.d.ts
+++ b/src/binarySearchTree.d.ts
@@ -3,14 +3,14 @@ import { BinarySearchTreeNode } from './binarySearchTreeNode';
 export class BinarySearchTree<T extends number|string, U = undefined> {
   insert(key: T, value?: U): BinarySearchTreeNode<T, U>;
   has(key: T): boolean;
-  find(key: T): BinarySearchTreeNode<T, U>;
-  max(node?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
-  min(node?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
-  lowerBound(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U>;
-  floor(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U>;
-  upperBound(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U>;
-  ceil(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U>;
-  root(): BinarySearchTreeNode<T, U>;
+  find(key: T): BinarySearchTreeNode<T, U> | null;
+  max(node?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U> | null;
+  min(node?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U> | null;
+  lowerBound(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U> | null;
+  floor(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U> | null;
+  upperBound(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U> | null;
+  ceil(k: T, includeEqual?: boolean): BinarySearchTreeNode<T, U> | null;
+  root(): BinarySearchTreeNode<T, U> | null;
   count(): number;
   remove(k: T): boolean;
   traverseInOrder(cb: (node: BinarySearchTreeNode<T, U>) => void): void;
diff --git a/src/binarySearchTreeNode.d.ts b/src/binarySearchTreeNode.d.ts
index 5c1878b..5c1afe8 100644
--- a/src/binarySearchTreeNode.d.ts
+++ b/src/binarySearchTreeNode.d.ts
@@ -1,17 +1,17 @@
 export class BinarySearchTreeNode<T extends number|string, U = undefined> {
-  constructor(key: T, value: U);
+  constructor(key: T, value?: U);
   setKey(key: T): BinarySearchTreeNode<T, U>;
   getKey(): T;
   setValue(value: U): BinarySearchTreeNode<T, U>;
   getValue(): U;
-  setLeft(left: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
-  getLeft(): BinarySearchTreeNode<T, U>;
+  setLeft(left?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
+  getLeft(): BinarySearchTreeNode<T, U> | null;
   hasLeft(): boolean;
-  setRight(right: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
-  getRight(): BinarySearchTreeNode<T, U>;
+  setRight(right?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
+  getRight(): BinarySearchTreeNode<T, U> | null;
   hasRight(): boolean;
-  setParent(right: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
-  getParent(): BinarySearchTreeNode<T, U>;
+  setParent(parent?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
+  getParent(): BinarySearchTreeNode<T, U> | null;
   hasParent(): boolean;
   isRoot(): boolean;
   isLeaf(): boolean;

From 419b8854a9fd1a1553d7e25c71215994b71f7226 Mon Sep 17 00:00:00 2001
From: Eyas Ranjous <eyas.ranjous@gmail.com>
Date: Wed, 13 Oct 2021 00:26:02 -0500
Subject: [PATCH 2/2] ?

---
 src/binarySearchTreeNode.d.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/binarySearchTreeNode.d.ts b/src/binarySearchTreeNode.d.ts
index 5c1afe8..82e3b34 100644
--- a/src/binarySearchTreeNode.d.ts
+++ b/src/binarySearchTreeNode.d.ts
@@ -2,7 +2,7 @@ export class BinarySearchTreeNode<T extends number|string, U = undefined> {
   constructor(key: T, value?: U);
   setKey(key: T): BinarySearchTreeNode<T, U>;
   getKey(): T;
-  setValue(value: U): BinarySearchTreeNode<T, U>;
+  setValue(value?: U): BinarySearchTreeNode<T, U>;
   getValue(): U;
   setLeft(left?: BinarySearchTreeNode<T, U>): BinarySearchTreeNode<T, U>;
   getLeft(): BinarySearchTreeNode<T, U> | null;