Leetcode 1586. Binary Search Tree Iterator II

Design a bidirectional in-order iterator for a binary search tree that lets you move forward and backward through the sorted elements via next()/hasNext() and prev()/hasPrev(); implement it to support efficient (amortized O(1)) operations using only O(h) extra space (h = tree height) without modifying the tree.