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

Environmental technology examples

meriva

Exhaust Gas Recirculation (EGR) for NOx control
<span>Positive Crankcase Ventilation (PCV) for HC emission control </span>
Evaporative Emissions Control(EVAP)
<span>Catalytic Converter for HC and NOx control</span>

6 0

3 years ago

Use an ifstream object named indata to read the first three integers from a file called lottowins and write each number to stand

Gemiola [76]

Answer:

int x;

indata.open("lottowins");

indata >> x;

cout << x << endl;

indata >> x;

cout << x << endl;

indata >> x;

cout << x << endl;

indata.close();

4 0

3 years ago

I need help with this

Elodia [21]

The answer is number 2.

8 0

3 years ago

What is the output of 1101×10==11000+10

aliya0001 [1]

Answer:

west ward cpt output

Explanation:

i know because i invented it

6 0

3 years ago

Your friend wants to know about Microsoft Expression Web 4.

Vlad [161]

Microsoft Expression Web 4 is
--
Component of Expression Studio
--
Design and Develop Web Pages using HTML5, CC3, ASP.Net, and more
--
Requires .Net Framework & Silverlight 4.0
--

3 0

3 years ago