Solve problems that are commonly asked in C++ coding interviews related to common data structures.

Ace the C++ Coding Interview

Data structures are among the fundamentals of computer science and are often a core decision in developing efficient programs. They are categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This module contains a detailed review of common data structures in C++. We'll also become well-equipped with different data structures by implementing them.
By the end of this module, we'll have expertise in solving problems in data structures.

Data Structures

# Case 2: Element at Internal Node:

Deletion is always performed at the leaf. So whenever we need to delete a key at the internal node, we swap it with any of its in-order successors and somehow make it shift to any leaf node as deletion is always performed at the *leaf*. Shift the element at the leaf node and then delete it. The element to be deleted can be swapped by:
- an element with the largest key on the *left*
- an element with the smallest key on the *right*


This is applicable when the child node has more than one key stored at the node. If there is only one value at the child node, then you are bound to swap the parent with whatever value the child node has. 

$$$$
# Example 

See the following illustration which covers the two scenarios that we discussed above:

How do we delete an element present at an internal node? It will be explained in this lesson with the help of an example.  

2-3 Deletion (Case #2)

How do we delete an element present at an internal node? It will be explained in this lesson with the help of an example.