Algoritmlar (animatsiya)Brauzeringizda ishlaydiTekshirilgan sana: 1-oktabr, 2026

Trie Autocomplete animatsiyasi

Trie Autocomplete animatsiyasi. Front-end uchun animatsiyali algoritmlar: saralash, qidirish, debounce va throttle, event loop, virtual DOM, kesh, trie va yoʻl topish. Brauzeringizda tez, maxfiy va oson ishlaydi.

Mahalliystandart holatda maxfiyTezroʻyxatdan oʻtish shart emas

Quyidagi tool tugmalari va matnlari hozircha ingliz tilida.

Data structuresTime: O(prefix length + results)Space: O(total letters)

Words in the dictionaryUser typed (prefix)

•

Step 1 / 14

A trie stores words letter by letter, so words that share a prefix share a path. A star (*) marks the end of a word.

JavaScript

1class Trie {
2  constructor() { this.root = { children: {}, end: false }; }
3  insert(word) {
4    let node = this.root;
5    for (const ch of word) {
6      node = node.children[ch] ??= { children: {}, end: false };
7    }
8    node.end = true;
9  }
10  suggest(prefix) {
11    let node = this.root;
12    for (const ch of prefix) {
13      node = node.children[ch];
14      if (!node) return [];
15    }
16    return collect(node, prefix); // every node with end: true is a word
17  }
18}

Tip: use the arrow keys to step and the space bar to play or pause.

Loading animation...