dsert1/Augmented-Tree-Searching

This is my solution to a problem of finding the ith node in an size-augmented Binary Search Tree, which means that every node has information on how many nodes are in each branch to the left and right.

Python