Solution: Find Ancestors of a Given Node in a BST
Explore methods to find ancestors of a specific node in a binary search tree using both recursive and iterative approaches. Understand how to implement these solutions in C++, and analyze their time and space complexities in balanced and skewed BSTs.
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.
-
Node.data