Skip to main content
100%

Binary search tree implemented in js

✓ Published0🌍 Public
Aallyraza
Last edited Jan 19, 2017
Created on Jan 19, 2017

This example demonstrates an in-order traversal of a binary search tree, printing each node’s value to the console in ascending order. The tree is built iteratively from hardcoded values (100, 5, 10, 25, 14, 140, 314, 500) using plain JavaScript functions `createNode` and `addNode`, with no external libraries. The `traverse` function recursively visits the left subtree, logs the current value, then visits the right subtree, showing the classic depth-first search pattern. The output appears as sequential `console.log` messages, not as a graphical visualization.

AI-generated description

Similar vizzes

Loading thumbnail…

ESNextbin Sketch

A binary tree visualization demonstrates how random numbers are inserted into a binary search tree, reporting each insert’s step count and the sorted list after all inserts. It also searches for a random value, showing whether it is found and the steps taken. The example uses plain JavaScript with ES6 classes (`BinaryTree`, `App`) and writes output via `document.write`. No external charting library is used; the rendering is simple HTML list and paragraph elements.

OOscardR
68% match
Loading thumbnail…

Gist 79ed32828a2db39ec232

This example demonstrates a divide-and-conquer binary search tree constructed over a set of disjoint line segments that span a horizontal strip, with endpoints on two parallel lines. It visualizes how the segments partition the strip into regions and how a query point can be located by traversing the tree. The code uses D3.js with SVG to draw the segments, circles, and tree edges, and employs custom helper functions like `dataAppend` and `translate` from d3-jetpack. The tree is built by recursively splitting the sorted list of bottom endpoints, and the visualization highlights the connection between the geometric arrangement and the hierarchical search structure.

11wheel
64% match
Loading thumbnail…

Tree Traversals

This interactive visualization demonstrates depth-first and breadth-first tree traversal algorithms on a small dummy dataset. Two buttons trigger the respective traversals, animating each visited node by coloring it red in sequence, while a reset button restores the original white and steel-blue styling. The tree is rendered as a static D3 dendrogram using `d3.layout.tree`, with nodes and links drawn as SVG circles and lines. The animations are driven by chained `transition().style()` calls with incremental delays, and the traversal logic itself relies on basic JavaScript array operations—a stack for depth-first and a queue for breadth-first.

PPooky2011
64% match
Loading thumbnail…

Red-Black Binary Tree

This example visualizes a red-black binary tree, demonstrating node insertion and layout in real time. It uses D3.js v4 with a force-directed simulation (`d3.forceSimulation`) to position nodes, applying forces for body repulsion, link attraction, and depth-based horizontal/vertical positioning. Users can toggle between SVG and Canvas rendering, with an optional low-resolution Canvas mode on high-DPI displays. The tree structure is built via `d3.binaryTree`, and the code instruments the `insert` method to animate each new node’s placement before re-rendering.

MMo
62% match
Loading thumbnail…

Red-Black Binary Tree

This example visualizes a red-black binary tree, demonstrating node insertion and layout in real time. It uses D3.js v4 with a force-directed simulation (`d3.forceSimulation`) to position nodes, applying forces for body repulsion, link attraction, and depth-based horizontal/vertical positioning. Users can toggle between SVG and Canvas rendering, with an optional low-resolution Canvas mode on high-DPI displays. The tree structure is built via `d3.binaryTree`, and the code instruments the `insert` method to animate each new node’s placement before re-rendering.

MMo
62% match
Loading thumbnail…

insertion sort in node

This visualization demonstrates an insertion sort algorithm sorting an array of thirteen numbers in ascending order. It uses JavaScript’s native array operations and a while loop to shift elements, showing the step-by-step reordering of the dataset. The code relies on standard JavaScript syntax rather than external libraries, logging the final sorted array to the console via `console.log`. The visualization captures the algorithm’s logic through the source code itself, illustrating the comparison and insertion mechanics without graphical rendering.

VVinodLouis
61% match
Loading thumbnail…

Code searches a Tree of nodes, depth-first

This example visualizes a depth-first search of a tree, showing the search path as nodes are visited and discarded. It uses a custom Node class in Python to build the tree structure, with each node holding a value and a list of children. The dfs function traverses the tree using a stack, popping nodes to check their values and printing each visited node to display the search order. The code defines two sample trees and searches for a specific target value, demonstrating how the algorithm explores branches before backtracking.

Aantonyross
60% match
Loading thumbnail…

Implementing bubble sort in node

This visualization demonstrates a bubble sort algorithm in action, using an array of 13 numbers as the data source. The code implements the sort with nested JavaScript loops, comparing adjacent values and swapping them when the left value exceeds the right one, with a temporary variable storing values during each swap. The inner loop iterates progressively fewer times through the array on each pass, accounting for elements already sorted at the end. A console.log statement outputs the fully sorted array, while commented-out logging shows the sort state at each iteration for debugging.

VVinodLouis
60% match