A tree data structure is a non-linear data structure because it does not store in a sequential manner. Other data structures such as arrays, linked list, stack and queue are linear data structures that store data sequentially. Different tree data structures allow quicker and easier access.
Table of contents
Trees-Data StructureWhat is Tree?Why we need Tree as Data-Structure?Why Tree is considered a non-linear Data-Structure?Basic Terminologies in Tree Data-Structure:Example of Tree Data-StructureBinary Search Tree RepresentationImplementation of Tree NodeBasic OperationsTypes of Tree Data-StructuresProperties of Tree Data-StructureApplications of Tree Data-Structure:2 Comments
Sort: