CS255 Notes

Composite Data Types

Data-type made up of one or more types of variables

User-defined

Creating the Object-Type Composite Data Type

Struct

A type in Object-Oriented Programming (OOP) that holds attributes and methods

Class

A central syntax in OOP that contains attributes and methods

Encapsulation

OOP principle where methods are public and data is private

Inheritance

OOP concept defining relationships between different classes

Polymorphism

OOP feature allowing code reuse for multiple purposes

Constructors

Special member methods in classes called automatically when an instance is declared

Dynamic Allocation

Using keywords like new and delete to allocate and deallocate memory

Array-Based Lists

Abstract data type allowing storage, insertion, deletion, and search of data of the same type

Node

Dynamically allocate & link new nodes whenever an insert function is called

Ordered Linked Lists

A data structure where a new value can be inserted at exactly one place to maintain a sorted list

Recursive Definition

Defining a problem solution in terms of smaller versions of itself without using loops

Binary Trees

Data structures made of nodes where each node contains data and points to other nodes, maintaining a hierarchy

Binary Search Tree

A type of binary tree where each node may have 0, 1, or 2 children, aiding in searching for values efficiently

Tree Traversals

Operations like Pre-Order, In-Order, and Post-Order to navigate through binary trees in a specific order

Binary Search Tree Property

Nodes in the left subtree have values less than the root, and nodes in the right subtree have values greater, aiding in efficient value search.