Computer Science, asked by Sureshj5409, 9 months ago

What traversal is used in bfs in tree data structure?

Answers

Answered by Anonymous

4

Answer:

We will examine how a common data structure can be used to help traverse a tree in breadth-first order. A preorder traversal would visit the elements in the order: j, f, a, d, h, k, z. This type of traversal is called a depth-first traversal. ... An inorder traversal would give us: a, d, f, h, j, k, z.

Previous Question

Next Question

Similar questions

Sociology, 5 months ago

Tell us about a time that you had to deal with a conflict between a licensed and unlicensed Personnel and how you handled the situation? *...

Math, 5 months ago

The diagonals of a ....... are parpendicular to each other please answer fast i beg u...

Math, 5 months ago

Point A(3,-2) B(1,-1) and C(k, 4) are collinear k=?

Physics, 9 months ago

A piece of cotton cloth gets wet if one end of it is dipped in water in a glass. This is due to (a) elasticity (b) capillarity (c) gravitation (d) viscosity.

Chemistry, 9 months ago

Difference between conduction and convection and radiation intuitive...

Hindi, 11 months ago

Easy example of vibhats rashi...

Math, 11 months ago

Which could be the measure of angle POS and angle POQ?

Physics, 11 months ago

Can an insulated Cooper wire be used in electric fuse?why or why not...