0
So i am struggling with this program I am creating that uses a binary search tree, and it only takes the right side of tree. It should return the value of the right-most node at each level, ordered top to bottom from a sequence of integers representing the BST (ex: 20 10 30 9 25, output: [20, 30,...