Skip to content

add binary tree structure #95

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
akshitagupta15june merged 1 commit into from
Oct 18, 2020
Merged

add binary tree structure #95

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
91 changes: 91 additions & 0 deletions DataStructures/BinaryTree.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,91 @@
class Node {
constructor(data) {
this.data = data;
this.left = null;
this.right = null;
}
}

class BinaryTree {
constructor() {
this.root = null;
}

insert(data) {
const newNode = new Node(data);

if (this.root === null) {
this.root = newNode;
} else {
this.insertNode(this.root, newNode);
}
}

insertNode(node, newNode) {
if (newNode.data < node.data) {
if (node.left === null) {
node.left = newNode;
} else {
this.insertNode(node.left, newNode);
}
} else {
if (node.right === null) {
node.right = newNode;
} else {
this.insertNode(node.right, newNode);
}
}
}

remove(data) {
this.root = this.removeNode(this.root, data);
}

removeNode(node, key) {
if (node === null) {
return null;
} else if (key < node.data) {
node.left = this.removeNode(node.left, key);
} else if (key > node.data) {
node.right = this.removeNode(node.right, key);
} else {
if (node.left === null && node.right === null) {
node = null;
} else if (node.left === null) {
node = node.right;
} else if (node.right === null) {
node = node.left;
} else {
const childRight = node.right;

this.insertNode(childRight, node.left);
node = childRight;
}
}
return node;
}

preorder(fn, node = this.root) {
if (node !== null) {
fn(node);
this.preorder(fn, node.left);
this.preorder(fn, node.right);
}
}

inorder(fn, node = this.root) {
if (node !== null) {
this.preorder(fn, node.left);
fn(node);
this.preorder(fn, node.right);
}
}

postorder(fn, node = this.root) {
if (node !== null) {
this.preorder(fn, node.left);
this.preorder(fn, node.right);
fn(node);
}
}
}