# binarytrees

> a javascript binary tree

Latest version **1.0.1** (published 2016-12-12) · MIT license · 0 weekly downloads

## Install

```sh
npm install binarytrees
pnpm add binarytrees
yarn add binarytrees
bun add binarytrees
```

## Health

**Score 15/100 (F)** — status: abandoned.

Positive: no vulnerabilities.

Warnings: low downloads; no types; no esm support.

Negative: abandoned; low maintenance score.

## Facts

| | |
|---|---|
| Version | 1.0.1 |
| Published | 2016-12-12 |
| First published | 2016-11-13 |
| Weekly downloads | 0 |
| License | MIT |
| TypeScript types | none |
| Module format | CommonJS |
| Dependencies | 0 |
| Known vulnerabilities | 0 |
| Install scripts | no |
| Author | Eric Li |
| Maintainers | lgl1993 |
| Keywords | binarytree |

## Links

- npm: https://www.npmjs.com/package/binarytrees
- npm.io page: https://npm.io/package/binarytrees

## Recent versions

- 1.0.1 (latest) — 2016-12-12
- 1.0.0 — 2016-11-13

## README

# Binary tree

a library of binary tree written by javascript


******

## Classes

- Queue
- Node
- BST (binary tree)

##methods
+   insert  

 insert node to binary tree

+   preOrder

  preorder traversal
+	midOrder  

 middel order traversal

+	postOrder  

 post order traversal

+	levelTraversal  

 level traversal

+	treeDepth  

 calulate the height of tree

+	findNode  
 
 find node in the tree

+	delNode  

 delete node of the tree



##Usage method


```javascript
var a = require('./binarytree');
var nums = new a.BST();
nums.insert(23)
nums.insert(45)
nums.insert(16)
nums.insert(37)
nums.insert(3)
nums.insert(99)
nums.insert(22)

nums.preOrder();

nums.midOrder();

nums.postOrder();

nums.levelTraversal();

height = nums.treeDepth()

var node = nums.findNode(45);

nums.delNode(45);
```

---
_Source: https://npm.io/package/binarytrees · Machine-readable twin of the npm.io package page. Health data is recomputed on every publish._