Метод | Описание | |
---|---|---|
BalancedTree ( object tokens, object vals, int lo, int hi, |
Inserting keys in TST in the order middle,small,big (lexicographic measure) recursively creates a balanced tree which reduces insertion and search times significantly.
|
|
Insert ( |
Inserts a key in TST creating a series of Binary Search Trees at each node. The key is actually stored across the eqKid of each node in a successive manner.
|
|
PrefixCompletion ( |
Auto-completes a given prefix query using Depth-First Search with the end of prefix as source node each time finding a new leaf to get a complete key to be added in the suggest list.
|
Метод | Описание | |
---|---|---|
TSTAutocomplete ( ) : System.Collections.Generic |
public BalancedTree ( object tokens, object vals, int lo, int hi, |
||
tokens | object | /// Sorted list of keys to be inserted in TST. |
vals | object | |
lo | int | /// stores the lower index of current list. |
hi | int | /// stores the higher index of current list. |
root | /// a reference object to root of TST. | |
Результат | void |
public Insert ( |
||
currentNode | /// a reference node where the insertion will take currently. | |
s | string | /// key to be inserted in TST. |
val | object | |
x | int | /// index of character in key to be inserted currently. |
Результат |
public PrefixCompletion ( |
||
root | /// a reference to root node of TST. | |
s | string | /// prefix query to be auto-completed. |
x | int | /// index of current character to be searched while traversing through /// the prefix in TST. |
Результат | List |