Skip to content

wrote the tree more object oriented #50

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
christianbender merged 1 commit into from
Mar 30, 2018
Merged

wrote the tree more object oriented #50

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
156 changes: 84 additions & 72 deletions Data Structures/Tree/Binary Search Tree.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,87 +10,99 @@
* bigger.
*/

// Node in the tree
function Node(val) {
this.value = val;
this.left = null;
this.right = null;
}

// Search the tree for a value
Node.prototype.search = function(val) {
if (this.value == val) {
return this;
} else if (val < this.value && this.left != null) {
return this.left.search(val);
} else if (val > this.value && this.right != null) {
return this.right.search(val);
// class Node
var Node = (function () {
// Node in the tree
function Node(val) {
this.value = val;
this.left = null;
this.right = null;
}
return null;
}

// Visit a node
Node.prototype.visit = function() {
// Recursively go left
if (this.left != null) {
this.left.visit();
}
// Print out value
console.log(this.value);
// Recursively go right
if (this.right != null) {
this.right.visit();
}
}
// Search the tree for a value
Node.prototype.search = function (val) {
if (this.value == val) {
return this;
} else if (val < this.value && this.left != null) {
return this.left.search(val);
} else if (val > this.value && this.right != null) {
return this.right.search(val);
}
return null;
};

// Add a node
Node.prototype.addNode = function(n) {
if (n.value < this.value) {
if (this.left == null) {
this.left = n;
} else {
this.left.addNode(n)
// Visit a node
Node.prototype.visit = function () {
// Recursively go left
if (this.left != null) {
this.left.visit();
}
} else if (n.value > this.value) {
if (this.right == null) {
this.right = n;
} else {
this.right.addNode(n);
// Print out value
console.log(this.value);
// Recursively go right
if (this.right != null) {
this.right.visit();
}
}
}
};

function Tree() {
// Just store the root
this.root = null;
}
// Add a node
Node.prototype.addNode = function (n) {
if (n.value < this.value) {
if (this.left == null) {
this.left = n;
} else {
this.left.addNode(n)
}
} else if (n.value > this.value) {
if (this.right == null) {
this.right = n;
} else {
this.right.addNode(n);
}
}
};

// Inorder traversal
Tree.prototype.traverse = function() {
this.root.visit();
}
// returns the constructor
return Node;
}());

// Start by searching the root
Tree.prototype.search = function(val) {
var found = this.root.search(val);
if(found === null)
{
console.log(val + " not found");
}
else{
console.log("Found:"+found.value);
}
}

// Add a new value to the tree
Tree.prototype.addValue = function(val) {
var n = new Node(val);
if (this.root == null) {
this.root = n;
} else {
this.root.addNode(n);
}
}
// class Tree
var Tree = (function () {
function Tree() {
// Just store the root
this.root = null;
};

// Inorder traversal
Tree.prototype.traverse = function () {
this.root.visit();
};

// Start by searching the root
Tree.prototype.search = function (val) {
var found = this.root.search(val);
if (found === null) {
console.log(val + " not found");
}
else {
console.log("Found:" + found.value);
}
};

// Add a new value to the tree
Tree.prototype.addValue = function (val) {
var n = new Node(val);
if (this.root == null) {
this.root = n;
} else {
this.root.addNode(n);
}
};

// returns the constructor
return Tree;
}());

//Implementation of BST
var bst = new Tree();
Expand Down