AlgoPrecision

Tree Visualizer

Binary Search Trees

Build a BST, trace search decisions, and step through inorder traversal with highlighted nodes and synced pseudocode.

O(w * k)
*

Step Note

Start with an empty trie root.

Details
function trieSearch(words: string[], target: string) {
  const root = {}
  for (const word of words) insert(root, word)
  let node = root
  for (const char of target) {
    if (!node.children[char]) return false
    node = node.children[char]
  }
  return node.isWord === true
}