Directory
| 0 | Introduction | |
| 1 | Insertion | |
| 2 | Search | |
| 3 | Depth-First Search | |
| 4 | Breadth-First Search | |
| 5 | Get Depth | |
| 6 | Check Balance | |
| 7 | Get Diameter |
/****************************************************************
* Initialize the binary tree on the right.
*
* @param value (int)
*
* @method insert
* * Inserts values in the correct leaf using a recursive method
* *
* * @param newValue (int)
*
*****************************************************************/
function Node(value) {
this.left = null
this.right = null
this.value = value
this.insert = function(newValue) {
if (newValue < this.value) {
if (this.left == null) {
this.left = new Node(newValue)
} else {
this.left.insert(newValue)
}
} else if (newValue > this.value) {
if (this.right == null) {
this.right = new Node(newValue)
} else {
this.right.insert(newValue)
}
}
Console
binari@env/wrkspc120 > Success
Binary Search Tree
Introduction
A Binary Search Tree is a node-based binary tree data structure which has the following properties:
- The left subtree of a node contains only nodes with keys lesser than the node’s key.
- The right subtree of a node contains only nodes with keys greater than the node’s key.
- The left and right subtree each must also be a binary search tree.
- There must be no duplicate nodes.