S-STEM Scholar Ashur Baroutta's Blog

DSA GRIND #12  by Ashur Baroutta   

                DSA GRIND #11 - Ashur Baroutta        This week we spent a lot of time attacking a problem that required us to look at a specific "side" of a binary tree. Our problem statement requests we imagine we are standing on the right side of a binary tree and returning the numbers we see from top to bottom.       This had me stumped for a good while, I knew how to traverse a Binary tree. I knew how to check for values greater than each other for a given node and leaf.  However, only checking and comparing right-side nodes with each other and then printing from the top down was a whole different game for me.       In the end, I managed but not before spending more time on this than any project I've done to this point this semester. Glad I got through it, I'm trying to find different usecases for this sort of application but maybe its biggest benefit was just challenging m...