3 years ago

What are search tries? Why are they more efficient than usualsearching algorithms?

Computers and Technology

1 answer:

Sati [7]3 years ago

6 0

Answer:

Trie is a tree based data structure where the keys are strings.

Search trees are a data structures in Computer Science in which they are based on trees.

Explanation:

Search trees are tree based data structures which are used to search elements in the tree as the names suggests (search tree). However, for a tree to perform as search tree the key it has to follow specific conditions. They are , the the key of any node has to be less than the all the keys present in the right sub trees and greater than all the keys present in the left subtree.

You might be interested in

What acronym describes networked devices that contain microcomputers but are not thought of as computing devices, such as refrig

vivado [14]

The acronym RFID (Radio Frequency Identification) describes networked devices that contain microcomputers but are not thought of as computing devices, such as refrigerators, automobile components, light bulbs, and industrial control devices. RFIDs are battery-powered sensors that gather and transmit data to a reading device. Some sensor based technologies are scanning electron microscopes, LiDAR,radar, GPS, x-ray, sonar, infrared and seismic.

5 0

3 years ago

Rick needs to find the lowest number in a set of numbers that includes decimals. Which statistical function in a spreadsheet wil

professor190 [17]

Umm

I’m in 10th grade so.....what is a spreadsheet and statistical function

4 0

3 years ago

Read 2 more answers

_____ is the operation of setting a variable to a value.

Helen [10]

Answer:

Assignment is the operation of a variable to a value