Qingquan Li

> It is common for classes to interact, or collaborate, with one another to perform their operations. Part of the object-oriented design process is identifying the collaborations between classes. ##...

Reference: Book: *Starting Out with C++ from Control Structures to Objects, byTony Gaddis, ninth edition* > Concept: A destructor is a member function that is automatically called when an object...

Reference: Book: *Starting Out with C++ from Control Structures to Objects, byTony Gaddis, ninth edition* # Source Code, Object Code, and Executable Code ### 1. Source Code -> Preprocessor ->...

# 1. Run HTTP server ## 1.1 Use Python ```bash cd /path/to/your/project # Start a simple HTTP server listening on port 8080, serving files (e.g., HTML) from the current directory...

Binary Tree Traversal refers to the process of visiting each node in a binary tree exactly once in a specific order. The three common methods of traversal in binary trees...

# 1. Definition of Binary Tree - A binary tree is a tree data structure where each node has **at most two children**, referred to as the left child and...

# 1. Definition A Binary Search Tree is a node-based binary tree data structure which has the following properties: - The left subtree of a node contains only nodes with...

# 1. Definition of Graph A graph is a collection of nodes (or vertices) and the connections (or edges) between them. # 2. Properties of Graphs 1. **Vertices (Nodes)**: The...

# 1. Spanning Tree A spanning tree of a graph is a subgraph that includes all the vertices of the original graph and is a tree. Essentially, a spanning tree...

**Definition:** The shortest path algorithm, is a greedy algorithm, developed by Dijkstra. Dijkstra's algorithm is a method for finding the shortest path from a single source vertex to all other...