Skip to main content

implement a binary search tree in js -------------------------------------



//implement a binary search tree in js -------------------------------------
class TreeNode
{
data:any
left:TreeNode
right:TreeNode
constructor(__data:any)
{
this.data=__data;
}
}
class Tree
{

//add a node to the tree
root:TreeNode=null
//public----------------------------------------------------
public insert(data:any)
{
if(this.root!=null)
{
this.insertWithLeaf(data,this.root)
}else
{
this.root=new TreeNode(data);
this.root.left=null;
this.root.right=null;
}
}
//private----------------------------------------------------
private insertWithLeaf(data:any,leaf:TreeNode)
{
//add node to left
if(data<leaf.data)
{
if(leaf.left!=null)
{
this.insertWithLeaf(data,leaf.left);
}else
{
leaf.left=new TreeNode(data);
leaf.left.left=null;
leaf.left.right=null;
}
}
//add node to right
else if(data>leaf.data)
{
if(leaf.right!=null)
{
this.insertWithLeaf(data,leaf.right);
}else
{

leaf.right=new TreeNode(data);
leaf.right.left=null;
leaf.right.right=null;
}
}
}
//print data inorder-------------------------------------------left root right
printInOrder()
{
this.displayInOrder(this.root);
}
displayInOrder(leaf)
{
if(leaf!=null)
{
this.displayInOrder(leaf.left);
console.log(leaf.data);
this.displayInOrder(leaf.right);
}
}
//print preorder-----------root left right-----------------------------------
printPreOrder()
{
this.displayPreOrder(this.root);
}
displayPreOrder(leaf)
{
if(leaf!=null)
{
console.log(leaf.data);
this.displayPreOrder(leaf.left);
this.displayPreOrder(leaf.right);
}
}
//print preorder-----------left right root-----------------------------------
printPostOrder()
{
this.displayPostOrder(this.root);
}
displayPostOrder(leaf)
{
if(leaf!=null)
{
this.displayPostOrder(leaf.left);
this.displayPostOrder(leaf.right);
console.log(leaf.data);
}
}
//search in tree------------------------------divide into two parts

SearchInTree(node,data)
{
let currentNode=node;
while(currentNode!=null)
{
if(currentNode.data==data)
{
return currentNode;
}
if(currentNode.data>data)
{
currentNode=currentNode.left;
}
else if(currentNode.data<data)
{
currentNode=currentNode.right;
}
}
}
}

var binarySearchTree=new Tree();
binarySearchTree.insert("manish");
binarySearchTree.insert("sachin");
binarySearchTree.insert("seema");
binarySearchTree.insert("nitin");
binarySearchTree.insert("deepak");
binarySearchTree.insert("sanjay");
//console.log(binarySearchTree.Search(120));
/*
console.log("INORDER--------------------->>")
binarySearchTree.printInOrder();
console.log("PREORDER--------------------->>")
binarySearchTree.printPreOrder();

console.log("POSTORDER--------------------->>")
binarySearchTree.printPostOrder();
*/
console.log(binarySearchTree.SearchInTree(binarySearchTree.root,"manish"));

Comments

Post a Comment

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...
Post a Comment
Read more

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js
Post a Comment
Read more

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...
Post a Comment
Read more