DSA GRIND #11

             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 my mindset and the way I approach problems. The submission is as follows : 


Comments

Post a Comment

Popular posts from this blog

IP #6 : Reversing an Integer

Image
 Reversing an Integer by Ashur Baroutta     The focus of this submission will be on reversing a given integer passed into our function. Our problem statement is as follows "Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-2^31, 2^31 -1], then return 0." Seems simple, though was actually a little odd. My initial reaction is to convert the integer to a string and then just reverse each character. Though in a way that feels like cheating as I don't think that solution is in the spirit of the assignment,  and it takes more resources to complete.      Pivoting my attention to a mathematical solution made the problem a lot more fun. Say our first example for x is 123. The way we attack it is to setup variables to track the reversed total and to track the remainder of a given iteration, we also create a loop iterating through while x does not equal 0.  The ...
Read more

DSA GRIND #9

Image
 INVERTING A BINARY TREE - AB  This weeks problem is similar to our earlier work on reversing a linked list data structure, but in this instance we're going to be inverting a binary tree. The following picture shows an example of what that means. Like our earlier work, I went about doing this recursively as well. So kept making calls back to the function within itself as we went about inverting the data structure node for node. The results/code is as follows.  The code was solid, though the memory management was pretty lacking, its resource intensive holding the same calls within the stack for execution. 
Read more