This post discusses the problem of finding the parent of a node in a Binary Search Tree (BST) and presents three different solutions to solve it: recursion, iteration, and modifying the BST to store parent pointers.
Table of contents
1. Introduction2. What Is a Binary Search Tree?3. The Parent of a Node in a Binary Search Tree4. Implementing a Recursive Solution5. Implementing an Iterative Solution6. Creating a BST With Parent Pointers7. Conclusion6 Impressions