Data Structures and C++ Constants

A keyword used to declare a constant variable, ensuring its value cannot be changed after initialization.

A binary search tree where all nodes have only one child, effectively resembling a linked list.

A self-balancing binary search tree that maintains a specific height balance for optimal efficiency. Operations like insertion or deletion trigger rotations to maintain balance.

A function parameter that is passed by its memory location, allowing modifications within the function to directly affect the original variable.

A copy of an object created during function call to prevent unintended modifications to the original object.

A method within a class marked with 'const' at the end of the function signature, indicating it cannot modify any member variables of the class.

Variables within a class that store its state and can be accessed by member functions.

Methods used to access and modify the values of member variables, providing a controlled interface for interaction with the object's state.

A binary search tree (BST) is a data structure where for every node, all values in its left subtree are smaller and all values in its right subtree are larger.

A BST is considered degenerate when all nodes have only one child, effectively resembling a linked list.

The insertion of data into a BST in a sorted order results in a degenerate tree, similar to a linked list.

Maintaining a balanced BST ensures that the height of the tree remains relatively low, leading to efficient search operations.

A balanced binary search tree guarantees efficient search operations, allowing for fast retrieval of data.

If the height of a balanced BST with one lakh nodes is 20, finding a specific number requires approximately 20 comparisons.

Techniques like AVL trees and red-black trees maintain balance in a BST by performing rotations after insertion or deletions.

A complete binary tree has all its levels filled, with the exception of the last level which can be filled from left to right. This means that both left and right subtrees are filled with an equal number of nodes.

The height of a binary tree is the maximum number of edges from the root to the farthest leaf node.

The depth of a node in a BST is the number of edges from the root to that node.

A keyword in C++ that specifies a function cannot modify the object's data members. It ensures data integrity and prevents accidental changes.

A function that returns a reference to a local variable. This is a mistake as the variable's memory is released when the function ends, causing unpredictable behavior.

Returning a copy of a variable instead of a reference. This prevents changes in the calling function from affecting the original variable but can be inefficient for large objects.

Returning a reference to a member variable, allowing the caller to access and potentially modify its value. This requires careful use to ensure data integrity.

Use the const keyword before the reference type to prevent modifications to the returned member variable. This protects the object's data.

Using const before the reference type in a function declaration. This prevents the function from modifying the object passed to it.

A tree where all nodes on the right subtree are greater than the root, and all nodes on the left subtree are less than the root.

The process of creating a copy of an object. The copy constructor is used for this purpose.

The difference in height between the left and right subtrees of a node in a Binary Search Tree (BST).

A method of maintaining balance in a Binary Search Tree (BST) by performing rotations. These techniques ensure that the height of the tree remains relatively low, resulting in faster search operations.

The height of a node in a binary tree is defined as the height of its left subtree minus the height of its right subtree. Indicates the balance of a node in an AVL tree.