A binary tree, a simple type of branching linked data structure. In Computer science, a binary tree is a tree data structure in which each node has at most two children.

In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Computer science (or computing science) is the study and the Science of the theoretical foundations of Information and Computation and their Debt AIDS Trade in Africa (or DATA) is a Multinational non-government organization founded in January 2002 in London by U2 's Often a carefully chosen data structure will allow the most efficient algorithm to be used. In Computer science, efficiency is used to describe properties of an Algorithm relating to how much of various types of resources it consumes In Mathematics, Computing, Linguistics and related subjects an algorithm is a sequence of finite instructions often used for Calculation The choice of the data structure often begins from the choice of an abstract data type. In Computing, an abstract data type ( ADT) is a specification of a set of data and the set of operations that can be performed on the data A data type in Programming languages is an attribute of a datum which tells the computer (and the programmer something about the kind of datum it is A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide. A programming language is an Artificial language that can be used to write programs which control the behavior of a machine particularly a Computer. A data type in Programming languages is an attribute of a datum which tells the computer (and the programmer something about the kind of datum it is In Computer science, a reference is an object containing information which refers to data stored elsewhere as opposed to containing the data itself

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to certain tasks. For example, B-trees are particularly well-suited for implementation of databases, while networks of machines rely on routing tables to function. In Computer science, a B-tree is a Tree data structure that keeps data sorted and allows searches insertions and deletions in logarithmic amortized In Computer networking a routing table, or Routing Information Base (RIB, is an electronic table (file or database type object that is stored in a

In the design of many types of programs, the choice of data structures is a primary design consideration, as experience in building large systems has shown that the difficulty of implementation and the quality and performance of the final result depends heavily on choosing the best data structure. Computer programs (also software programs, or just programs) are instructions for a Computer. After the data structures are chosen, the algorithms to be used often become relatively obvious. In Mathematics, Computing, Linguistics and related subjects an algorithm is a sequence of finite instructions often used for Calculation Sometimes things work in the opposite direction - data structures are chosen because certain key tasks have algorithms that work best with particular data structures. In either case, the choice of appropriate data structures is crucial.

This insight has given rise to many formalised design methods and programming languages in which data structures, rather than algorithms, are the key organising factor. A programming language is an Artificial language that can be used to write programs which control the behavior of a machine particularly a Computer. Most languages feature some sort of module system, allowing data structures to be safely reused in different applications by hiding their verified implementation details behind controlled interfaces. A programming language is an Artificial language that can be used to write programs which control the behavior of a machine particularly a Computer. Modular programming is a software design technique that increases the extent to which software is composed from separate parts called modules Object-oriented programming languages such as C++ and Java in particular use classes for this purpose. Object-oriented programming (OOP is a Programming paradigm that uses " objects " and their interactions to design applications and computer programs A programming language is an Artificial language that can be used to write programs which control the behavior of a machine particularly a Computer. C++ (" C Plus Plus " ˌsiːˌplʌsˈplʌs is a general-purpose Programming language. In Object-oriented programming, a class is a Programming language construct that is used as a blueprint to create objects This blueprint includes attributes

Since data structures are so crucial, many of them are included in standard libraries of modern programming languages and environments, such as C++'s Standard Template Library containers, the Java Collections Framework, and the Microsoft .NET Framework. A programming language is an Artificial language that can be used to write programs which control the behavior of a machine particularly a Computer. C++ (" C Plus Plus " ˌsiːˌplʌsˈplʌs is a general-purpose Programming language. The Standard Template Library ( STL) is a software library partially included in the C++ Standard Library. The Standard Template Library ( STL) is a software library partially included in the C++ Standard Library.

The fundamental building blocks of most data structures are arrays, records, discriminated unions, and references. In Computer science an array is a Data structure consisting of a group of elements that are accessed by indexing. This article is about the data structure and the type In Computer science, a record type is a type whose values are records, i In Computer science, a tagged union, also called a variant variant record discriminated union, or Disjoint union, is a Data structure used In Computer science, a reference is an object containing information which refers to data stored elsewhere as opposed to containing the data itself For example, the nullable reference, a reference which can be null, is a combination of references and discriminated unions, and the simplest linked data structure, the linked list, is built from records and nullable references. In Computer science, a linked list is one of the fundamental Data structures and can be used to implement other data structures

Data structures represent implementations or interfaces: A data structure can be viewed as an interface between two functions or as an implementation of methods to access storage that is organized according to the associated data type. Implementation is the realization of an application or execution of a Plan, idea Model, Design, Specification, standard, Algorithm Interface generally refers to an abstraction that an entity provides of itself to the outside A data type in Programming languages is an attribute of a datum which tells the computer (and the programmer something about the kind of datum it is

See also

• Persistent data structure
• Unstructured data
• Dynamization
• List of data structures

External links

• Descriptions from the Dictionary of Algorithms and Data Structures
• http://www.cse.unr.edu/~bebis/CS308/
• Data structures course with animations
• data structure course notes
• Bruno R. In Computing, a persistent data structure is a Data structure which always preserves the previous version of itself when it is modified such data structures Unstructured data (or unstructured information) refers to (usually computerized information that either does not have a Data structure or has one that is not easily In Computer science, Dynamization is the process of transforming a Static data structure into a dynamic one This is a list of Data structures For a wider list of terms see List of terms relating to algorithms and data structures. The Dictionary of Algorithms and Data Structures is a dictionary style reference for many Algorithms "algorithmic techniques" "archetypal problems" and Preiss, Data Structures and Algorithms with Object-Oriented Design Patterns in C++, Java, C#, Python, Ruby