Created
March 4, 2018 10:57
-
-
Save aledwassell/2a1b3c21b435585f1a5d6a33b510e746 to your computer and use it in GitHub Desktop.
Making a binary tree from 10 random numbers
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| (function() { | |
| let tree; | |
| function Tree(n) { | |
| this.root = null; | |
| } | |
| Tree.prototype.add = function(val){ | |
| let n = new Node(val) | |
| if(this.root === null){ | |
| this.root = n | |
| } else { | |
| this.root.addNode(n) | |
| } | |
| } | |
| 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); | |
| } | |
| } | |
| } | |
| function Node(val) { | |
| this.value = val; | |
| this.left = null; | |
| this.right = null; | |
| } | |
| function makeTree(){ | |
| tree = new Tree() | |
| let crazyArr = [50,3,65,32,89,76,43,2,1,78,99,102,47,22,27] | |
| for (var i = 0; i < 10; i++) { | |
| tree.add(Math.floor(Math.random() * (100 - 1) + 1)) | |
| } | |
| console.log(tree); | |
| } | |
| makeTree() | |
| })(); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <meta charset="utf-8"> | |
| <title></title> | |
| </head> | |
| <body> | |
| <script type="text/javascript" src="app.js"></script> | |
| </body> | |
| </html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment