{"version":"1.0","type":"rich","title":"Binary search tree implemented in js","description":"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.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-7825b3cfa7fe9dcefc2f7f511347021b?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}