Problem:

Binary Search Tree to Doubly Linked List

Solution:

– Traverse in reverse InOrder (i.e. Right-Node-Left)

Latest Source Code:

Github: BinarySearchTreeToDoublyLinkedList2.java

**Output:**

6 / \ / \ / \ / \ -13 14 \ / \ \ / \ -8 13 15 / 7 Forward: -13 -8 6 7 13 14 15 Backward: 15 14 13 7 6 -8 -13