## [Leetcode] Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST