Example of binary tree search data structure with TypeScript

binary-tree-search-data-structure.ts

type DataStructure = {
  value: number
  branchRight: DataStructure
  branchLeft: DataStructure
}

class Tree {
  private static data: DataStructure
  
  constructor() {
    Tree.data = {} as DataStructure
  }

  add(value: number): void {
    this.addOnBranch(Tree.data, value)
  }
  
  addOnBranch(branch: DataStructure, value: number): void {
    if (branch.value) {
      if (value > branch.value) {
        this.addOnBranch(branch.branchRight, value)
      } else {
        this.addOnBranch(branch.branchLeft, value)
      }
    } else {
      branch.value = value
      branch.branchRight = {} as DataStructure
      branch.branchLeft = {} as DataStructure
    }
  }
  
  getData(): DataStructure {
    return Tree.data
  }
}

const tree = new Tree()

tree.add(10)
tree.add(9)
tree.add(11)
tree.add(12)

console.log("Tree Inserted #4", tree.getData())

/*
OUTPUT:
Tree Inserted #4 { 
  value: 10,
  branchRight: { 
    value: 11, 
    branchRight: { 
      value: 12, 
      branchRight: {},
      branchLeft: {} 
    },
    branchLeft: {} 
  },
  branchLeft: { 
    value: 9, 
    branchRight: {}, 
    branchLeft: {}
  }
}
*/