mandeep kaurlovely professional university unit -trees notes contents objectives introduction -trees structure of -trees height of -trees operations on -trees inserting new item -tree-deleting an item -tree algorithms applications summary keywords self assessment review questions further readings objectives after studying this unityou will be able toexplain the concept of -trees describe -trees algorithms introduction the key factors which have been discussed in this unit about the -trees in data structures while dealing with many problems in computer scienceengineering and many other disciplinesit is needed to impose hierarchical structure on collection of data items for examplewe need to impose hierarchical structure on collection of data items while preparing organizational charts and genealogiesto represent the syntactic structure of source programs in compilers -tree is tree data structure that keeps data sorted and allows insertions and deletions that is logarithmically proportional to file size it is commonly used in databases and file systems -trees in -treesinternal nodes can have variable number of child nodes within some pre-defined range when data is inserted or removed from nodeits number of child nodes changes in order to maintain the pre-defined rangeinternal nodes may be joined or split because range of child nodes is permittedb-trees do not need re-balancing as frequently as other self balancing lovely professional university