javascript binary search tree
javascript binary search tree
xxxxxxxxxxclass BinarySearchTreeNode { constructor(key, value = key, parent = null) { this.key = key; this.value = value; this.parent = parent; this.left = null; this.right = null; } get isLeaf() { return this.left === null && this.right === null; } get hasChildren() { return !this.isLeaf; }}class BinarySearchTree { constructor(key, value = key) { this.root = new BinarySearchTreeNode(key, value); } *inOrderTraversal(node = this.root) { if (node.left) yield* this.inOrderTraversal(node.left); yield node; if (node.right) yield* this.inOrderTraversal(node.right); } *postOrderTraversal(node = this.root) { if (node.left) yield* this.postOrderTraversal(node.left); if (node.right) yield* this.postOrderTraversal(node.right); yield node; } *preOrderTraversal(node = this.root) { yield node; if (node.left) yield* this.preOrderTraversal(node.left); if (node.right) yield* this.preOrderTraversal(node.right); } insert(key, value = key) { let node = this.root; while (true) { if (node.key === key) return false; if (node.key > key) { if (node.left !== null) node = node.left; else { node.left = new BinarySearchTreeNode(key, value, node); return true; } } else if (node.key < key) { if (node.right !== null) node = node.right; else { node.right = new BinarySearchTreeNode(key, value, node); return true; } } } } has(key) { for (let node of this.postOrderTraversal()) { if (node.key === key) return true; } return false; } find(key) { for (let node of this.postOrderTraversal()) { if (node.key === key) return node; } return undefined; } remove(key) { const node = this.find(key); if (!node) return false; const isRoot = node.parent === null; const isLeftChild = !isRoot ? node.parent.left === node : false; const hasBothChildren = node.left !== null && node.right !== null; if (node.isLeaf) { if (!isRoot) { if (isLeftChild) node.parent.left = null; else node.parent.right = null; } else { this.root = null; } return true; } else if (!hasBothChildren) { const child = node.left !== null ? node.left : node.right; if (!isRoot) { if (isLeftChild) node.parent.left = child; else node.parent.right = child; } else { this.root = child; } child.parent = node.parent; return true; } else { const rightmostLeft = [this.inOrderTraversal(node.left)].slice(-1)[0]; rightmostLeft.parent = node.parent; if (!isRoot) { if (isLeftChild) node.parent.left = rightmostLeft; else node.parent.right = rightmostLeft; } else { this.root = rightmostLeft; } rightmostLeft.right = node.right; node.right.parent = rightmostLeft; return true; } }}Source: www.30secondsofcode.org
Closely Related Answers
xxxxxxxxxxclass Node { constructor(value){ this.value = value this.left = null this.right = null }}class BinarySearchTree { constructor(){ this.root = null } find(value){ if(!this.root) return false let current = this.root let found = false while(current && !found){ if(value < current.value){ current = current.left } else if(value > current.value){ current = current.right } else { found = current } } if(!found) return undefined; return found } insert(value){ var newNode = new Node(value); if(this.root === null){ this.root = newNode; return this; } let current = this.root; while(current){ if(value === current.value) return undefined; if(value < current.value){ if(current.left === null){ current.left = newNode; return this; } current = current.left; } else { if(current.right === null){ current.right = newNode; return this; } current = current.right; } } }}Source: rocoderes.com
xxxxxxxxxxclass Node { constructor(value){ this.value = value this.left = null this.right = null }}class BinarySeachTree { constructor(){ this.root = null }}Source: gist.github.com
xxxxxxxxxxclass BinaryTreeNode { constructor(key, value = key, parent = null) { this.key = key; this.value = value; this.parent = parent; this.left = null; this.right = null; } get isLeaf() { return this.left === null && this.right === null; } get hasChildren() { return !this.isLeaf; }}class BinaryTree { constructor(key, value = key) { this.root = new BinaryTreeNode(key, value); } *inOrderTraversal(node = this.root) { if (node.left) yield* this.inOrderTraversal(node.left); yield node; if (node.right) yield* this.inOrderTraversal(node.right); } *postOrderTraversal(node = this.root) { if (node.left) yield* this.postOrderTraversal(node.left); if (node.right) yield* this.postOrderTraversal(node.right); yield node; } *preOrderTraversal(node = this.root) { yield node; if (node.left) yield* this.preOrderTraversal(node.left); if (node.right) yield* this.preOrderTraversal(node.right); } insert( parentNodeKey, key, value = key, { left, right } = { left: true, right: true } ) { for (let node of this.preOrderTraversal()) { if (node.key === parentNodeKey) { const canInsertLeft = left && node.left === null; const canInsertRight = right && node.right === null; if (!canInsertLeft && !canInsertRight) return false; if (canInsertLeft) { node.left = new BinaryTreeNode(key, value, node); return true; } if (canInsertRight) { node.right = new BinaryTreeNode(key, value, node); return true; } } } return false; } remove(key) { for (let node of this.preOrderTraversal()) { if (node.left.key === key) { node.left = null; return true; } if (node.right.key === key) { node.right = null; return true; } } return false; } find(key) { for (let node of this.preOrderTraversal()) { if (node.key === key) return node; } return undefined; }}Source: www.30secondsofcode.org
Twitter 
LinkedIn