By applying a node (Node) that is running on the root node (the Root Node) in addition, the structure of the tree when it was running fine until trees are most often to a tree that resembles the TIA and expansion from the concept of search patterns in General, that given the frequency of the node you want to find all nodes that are equal to each other, but were searching for a bit, they will have a chance to be discovered more easily. Therefore, to make the data more often, was the location of bon tree structure, it will make the search more quickly in the future. That speed in search of plants. Saple average speed is equal to O (log n)
การแปล กรุณารอสักครู่..