TLDR

1. Welcome!

2. SOC 2 Compliance Without Security Theater

3. 199. Binary Tree Right Side View

4. The recommendations I live by!

5. Self-Gaslight of the week

6. JOBS & SCHOLARSHIPS

Day 3: 199. Binary Tree Right Side View

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. 

Before we dive in,

Breathe

Nothing is ever that deep.

Now, let’s

But there is a little trick that I am about to teach you….

We’re going to leverage recursion to navigate through the tree and a map to store the nodes level by level, where the key is the level and the value is an array with the nodes in that level.

We are simply going to iterate through the tree INORDER, and store in our map the current node we are processing and their level:

treeNodes[level].push_back(root->val);

And every time we call our recursive function, we’re simply going to add 1 to our level so that when we traverse deeper into the tree, we know exactly where we are:

auxLevelOrder(root->left, level + 1); 
auxLevelOrder(root->right, level + 1);

This approach allows us to group nodes together INORDER by their levels as we go down the tree.

Once we have a map with the levels and nodes, we know exactly how to extract the right-side view. For each level, the last node in the array is the one visible from the right side.

Finally, we gather all these last nodes from each level and return them as the result. This method ensures we capture the rightmost nodes at every level, giving us the desired right-side view of the binary tree.

Complete code:

  void auxRightSideView(TreeNode* root, int level){ //InOrder
        if(root==NULL){
           return; 
        }
        auxRightSideView(root->left, level+1); 
        nodes_by_level[level].push_back(root->val);
        auxRightSideView(root->right, level+1); 
         
    }

    vector<int> rightSideView(TreeNode* root) {
       auxRightSideView(root,0); 
       vector<int>right_side_nodes; 
       for (const auto& [key, value] : nodes_by_level) {
          right_side_nodes.push_back(value.back());
       }
       return right_side_nodes;
    }

   

Recommendations

Level up your inbox by subscribing to what I am subscribed to!

Self-gaslight of the week

I truly believe you can gaslight yourself to success.

1. Are you hungry? Or are you bored?

2. There’s no way if you worked this hard, that it’s not going to lead somewhere amazing 

Jobs and Scholarships

1. New scholarships of this week!

2. Entry level jobs!!