Evaluation of Searching And Creation of B-tree And Binary Search Tree

Artificial Intelligence (AI) is the computational part of theability to achieve goal. A search algorithm, broadly speaking isan algorithm that takes a problem as input and returns asolution to the problem, usually after evaluating a number ofpossible solutions. Most of the algorithms studied by computerscientists that solve problems are kinds of search algorithms.The set of all possible solutions to a problem is called the space.Otherwise known as naive or uniformed , algorithms use thesimplest method of the searching through the search space ,whereas informed search algorithms use heuristic functions toapply knowledge about the structure of the search space to try toreduce the amount of time spent searching’s-tree is a datastructure that maintains an ordered set of data and followsefficient operations to find, delete, insert and browse the data. Inthis system, B-tree and Binary search tree algorithms are usedfor searching of Military terms and Weapons