Binary Tree Data Structure

What is the maximum number of children a node can have in a binary tree?

How is a binary tree represented?

What are the three types of traversals in a binary tree?

What are adjacent nodes in a graph?

What is a function parameter in C++?

List four Storage Classes in C++.

Why is it necessary to overload an operator in C++?

Write a C++ code to swap two variables using reference variables in a function.

What are the two most common ways to represent a graph?

How is a node represented in a tree data structure?

What are the differences between merge sort and quick sort?

What are the two types of graph traversal algorithms?

Binary Tree

A node in a binary tree can have a maximum of two children.
A binary tree is represented using nodes and edges, where each node has a value and at most two children (left and right).

Graph Traversal

Adjacent nodes in a graph are nodes that are connected by an edge.
There are two main types of graph traversal algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS).

C++ Programming

A function parameter in C++ is a variable declared in the function declaration that receives a value when the function is called.
There are four storage classes in C++: Automatic, Register, Static, and Extern.
Operator overloading is necessary in C++ to allow operators to work with user-defined data types, such as classes and structures.

Swapping Variables

Here is a C++ code to swap two variables using reference variables in a function:

void swap(int &amp;a, int &amp;b) {
    int temp = a;
    a = b;
    b = temp;
}

Graph Representation

The two most common ways to represent a graph are: Adjacency Matrix and Adjacency List.

Tree Data Structure

A node in a tree data structure is represented by a data value and a set of child nodes.

Sorting Algorithms

Merge sort and quick sort are two popular sorting algorithms that differ in their approach:
- Merge sort: divides the array into smaller chunks, sorts each chunk, and then merges them.
- Quick sort: selects a pivot element, partitions the array around it, and then recursively sorts the subarrays.

Learn about the definition and representation of a binary tree, where each node can have at most 2 children named left and right child. Understand the parts of a binary tree node including data, pointer to the left child, and pointer to the right child.