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

Best practices and trends for technology integration

cluponka [151]

Answer:

Technology use must be aligned to the standards. Technology must be integrated into daily learning,

Explanation:

Technology use must be aligned to the standards. Technology must be integrated into daily learning, not used as an add-on to instruction to match personal learning needs. Students need opportunities to use technology collaboratively. Technology must support project based learning and include real-world simulations.

3 0

2 years ago

The hardware and software that must be implemented to support the applications that the primary activities use are a part of the

Contact [7]

The answer is infrastructure

7 0

2 years ago

4 types of system software

Elina [12.6K]

Operating systems.
Device drivers.
Middleware.
Utility software.

8 0

3 years ago