Invert Binary Search Tree

Invert a binary tree.

Example:

     4 
   /   \
  2     7
 / \   / \
1   3 6   9

to

     4
   /   \
  7     2
 / \   / \
9   6 3   1

     4 
   /   \
  2     7
 / \   / \
1   3 6   9

Trees are crucial data structure in Computer Science. Often trees related problems are solved using recursion as it provides an elegant solution in this particular problem at least. The basic terminology to solve this problem is to swap the left and right values, if you work on the tree from the bottom the to the top swapping the left and right node, the tree will be inverted.

Let's go through an example:

You can start from left or right. So, starting from the left we have

  2          2       (swap the left and right node)
 / \   =>   / \ 
1   3      3   1

  7          7       (similarly, on the right sub-tree)
 / \   =>   / \ 
6   9      9   6

Which gives,

     4
   /   \
  2     7
 / \   / \
3   1 9   6

And finally,

     4    (swap again)
   /   \
  7     2
 / \   / \
9   6 3   1

Translating it into code:

  public TreeNode invertTree(TreeNode root) {
        
        if(root == null)  //base case
            return null;
        
         root.left = invertTree(root.left); //recursive call 
         root.right = invertTree(root.right); 
        
         TreeNode temp = root.left; //swap the nodes
         root.left = root.right;
         root.right = temp;
        
        return root;
}

Another concise version:

public TreeNode invertTree(TreeNode root) {
        
        if(root == null)  //base case
            return null;
         TreeNode temp = root.left; //swap the nodes
         root.left = invertTree(root.right); //recursive call 
         root.right = invertTree(temp); 
        return root;
    }

Please do leave a comment if you found this helpful or want to share your idea/thoughts to improve.

Comments

Non-decreasing Array - LeetCode

Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n). Example 1: Input: [4,2,3] Output: True Explanation: You could modify the first 4 to 1 to get a non-decreasing array. Example 2: Input: [4,2,1] Output: False Explanation: You can't get a non-decreasing array by modify at most one element. Note: The n belongs to [1, 10,000]. Source: LeetCode At first glance, it looks like an easy and straightforward problem, but believe me it's greedy problem. In the problem, you are allowed to make atmost "one" modification to make a non-decreasing array. Nondecreasing means that every element is greater than or equal to the one before it e.g. [1,3,4,4,5,6,9]. For example, [2,2,3,2,4] can this become non-decreasing? Yes, by replacing 3 with 2 =>[2,2,2,2,4]. What about this:

RLE Encoding and Decoding in C++

Given an input string, write a regular recursive function that returns the decoded (uncompresseed form) Run Length Encoded (is a simple form of data compression where repeated character are replaced by count followed by the character repeated) string for the input string. Below are some examples: decode("*") =>* decode("3+") =>+++ decode("11*") =>*********** decode("101+") =>+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ decode("abcde10+10*10+10x") =>abcde++++++++++**********++++++++++xxxxxxxxxx decode("\\") =>\ decode("\1\2\3") =>123 decode("13\7x") =>7777777777777x decode("5\\") =>\\\\\ decode("4\12\23\3") =>111122333 decode("4\\2\3") =>\\\\33 NOTE: To represent a single backslash, it’s necessary to place double backslashes (\\) in the input string to obtain the desired in

Merge Two Binary Trees

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree. Example 1: Input: Tree 1 Tree 2 1 2 / \ / \ 3 2 1 3 / \ \ 5 4 7 Output: Merged tree: 3 / \ 4 5 / \ \ 5 4 7 Note: The merging process must start from the root nodes of both trees. Source: LeetCode Solution: We traverse both trees in a preorder fashion. In

{ Programming }

Search This Blog