mg901 / ts-data-structures

bun-start

To install dependencies:

bun install

To run:

bun run index.ts

This project was created using bun init in bun v1.0.11. Bun is a fast all-in-one JavaScript runtime.

ts-data-structures's Issues

Binary Tree

Tree

Basic Concepts

• The height of a node is the length of the longest downward path to a leaf from that node. The height of the root is the height of the tree. Conventionally, an empty tree (tree with no nodes, if such are allowed) has height −1.
• The depth of a node is the length of the path to its root.

Binary Tree Node

interface BinaryTreeNode<T> extends Node<T> {
  left? BinaryTreeNode<T> | null
  right?: BinaryTreeNode<T> | null
  setLeft(value: T): this
  setRight(value: T): this
  removeChild(node: BinaryTreeNode<T>): boolean
}

setLeft or setRight method

1. Should disconnect the existing child node before setting a new one.
2. Should set child.

binary search tree

Binary Search Tree

interface BinarySearchTree<T> {
  root: BinarySearchTreeNode<T> | null
  insert(value: T): void
  contains(value: T): boolean
  remove(value: T): boolean
  toString(): string
}

Binary Search Tree Node

interface BinarySearchTreeNode<T> extends BinaryTreeNode<T> {
  insert(value): void
  find(value: T): BinariSearchTreeNode<T> | null
  contains(value: T): boolean
  remove(value: T): boolean
  findMin(): BinarySearchTreeNode<T>
  findMax(): BinarySearchTreeNode<T>
}