In: Computer Science
2) Explain the difference between TREE-SEARCH and GRAPH-SEARCH. Support your answer with an example.
Answer:
A tree graph is mannequin aged after represent hierarchical data. In similarity after natural trees, that has nodes, leaves and branches. A in many instances stated arbor is a even tree, of who each node contains leads according to twain lousy nodes.A plant enquire starts at the root then explores nodes beside there, searching because of one precise node as satisfies the stipulations mentioned of the problem. Unlike linear data structures, the elements do remain traversed within dense ways. There are deep algorithms so utilizes different order to traverse/pass thru a node.Graph Search is a search engine as is integrated including Facebook's communal graphs. The search engine procedures herbal speech queries according to rejoinder data from across the user's communal community concerning friends or connections and beyond, relying concerning the search.A graph may comprise cycles, a tree cannot. So so you are going after implement a search algorithm regarding a tree, thou don't want in imitation of reflect onconsideration on the entity about cycles, but so working together with an arbitrary graph, you will need in conformity with think about them.
Example:
Comment us for any queries...!
Please Gives a thumbs Up...!