How to check if two nodes are cousins in a Binary tree.
Given two values x and y, we have to write a code to check the nodes corresponding to values x and y are cousins or not. All the values in this binary tree are unique.
Two nodes of a binary tree are cousins if they have the same depth, but have different parents.
In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.
Let’s discuss an interesting problem Backspace String Compare.
Given two strings S and T containing backspaces. We have to write a code to check if they are equal. In string, # means a backspace character.
Example 1:
Input: S = “ab#c”, T = “ad#c”
Output: true
Explanation: Both S and T become “ac”.
Example 2:
Input: S = “ab##”, T = “c#d#”
Output: true
Explanation: Both S and T become “”.
Example 3:
Input: S = “a##c”, T = “#a#c”
Output: true
Explanation: Both S and T become “c”.
Example 4:
Input: S = “a#c”, T = “b”
Output: false
Explanation: S becomes “c” while T becomes “b”.