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

# Statement

Given the `root` node of a binary search tree (BST) and an integer value `k`, find all the ancestors of the node whose value is `k`.

> An **ancestor** of a node in a tree is any node on the path from the root to that node.

**Constraints:**

Let `n` be the number of nodes in a binary search tree.
* $1 \leq n \leq 500$
* $10^{-3 }\leq$ `Node.data` $\leq 10^3$
* The value `k` exists within the binary search tree
* All `Node.data` are unique


# Examples


 Try to solve the Find Ancestors of a Given Node in a BST problem.

Challenge: Find Ancestors of a Given Node in a BST

Try to solve the Find Ancestors of a Given Node in a BST problem.

Challenge 3: Find Ancestors of a given node in a BST

Statement