Options
All
  • Public
  • Public/Protected
  • All
Menu

Class BinarySearchTree

Binary Search Tree

Example

 
const BinarySearchTree = require('dsajs');

let bst = new BinarySearchTree();
bst.insert(1);
bst.insert(2);
...

Hierarchy

Index

Constructors

Properties

Accessors

Methods

Constructors

constructor

Properties

_compareFn

_compareFn: CompareFunction

_root

_root: null | default

Accessors

root

  • get root(): null | default

Methods

delete

  • delete(data: any): void

height

  • height(node?: null | default): number

inOrder

  • inOrder(): default[]

insert

  • insert(data: any): void

isBalance

  • isBalance(): boolean

isComplete

  • isComplete(): boolean

isEmpty

  • isEmpty(): boolean

isFull

  • isFull(): boolean

isPerfect

  • isPerfect(): boolean

postOrder

  • postOrder(): default[]

preOrder

  • preOrder(): default[]

search

  • search(data: any): null | default

  • Search a value(data) in binary search tree

    Parameters

    • data: any

    Returns null | default

    null if not found in binary tree

size

  • size(): number

Static isSubtree

Static isSymmetric

Generated using TypeDoc