Symmetric Binary Tree - Amazon Top Interview Questions


Problem Statement :


Given the root to a binary tree root, return whether it is symmetric.

Constraints

n ≤ 100,000 where n is the number of nodes in root

Example 1

Input

root = [0, [2, [5, null, null], [1, null, null]], [2, [1, null, null], [5, null, null]]]

Output

True

Example 2

Input

root = [1, [2, null, null], [3, null, null]]

Output

False

Example 3

Input

root = [1, [2, null, null], null]

Output

False

Example 4

Input

root = [1, null, [2, null, null]]

Output

False



Solution :



title-img




                        Solution in C++ :

bool solve(Tree* root) {
    if (!root) return true;
    stack<Tree*> p, q;
    p.push(root->left), q.push(root->right);
    while (!p.empty() && !q.empty()) {
        auto m = p.top(), n = q.top();
        p.pop(), q.pop();
        if (!m && !n) continue;
        else if (!m || !n) return false;
        if (m->val != n->val)
            return false;
        p.push(m->left), p.push(m->right);
        q.push(n->right), q.push(n->left);
    } 
    return p.empty() && q.empty();
}
                    


                        Solution in Java :

import java.util.*;

/**
 * public class Tree {
 *   int val;
 *   Tree left;
 *   Tree right;
 * }
 */
class Solution {
    public boolean solve(Tree root) {
        return versionA(root);
        // return versionB(root);
    }

    // breadth first search, with padding for null child nodes
    // performance: 62%
    // This also works when Tree is non-bianry, i.e. more than 2 child nodes for a parent node.
    boolean versionA(Tree root) {
        if (root == null) {
            return true;
        }

        // a special NULL node
        Tree padding = new Tree();

        ArrayList<Tree> list = new ArrayList<>();
        list.add(root);

        while (!list.isEmpty()) {
            if (!isValid(list, padding)) {
                return false;
            }
            list = getNextLevel(list, padding);
        }
        return true;
    }

    // check as if we were checking palindrome: all the nodes at one level
    boolean isValid(ArrayList<Tree> list, Tree padding) {
        int head = 0;
        int tail = list.size() - 1;

        while (head < tail) {
            if (!isValid(list.get(head), list.get(tail), padding)) {
                return false;
            }
            head++;
            tail--;
        }

        return true;
    }

    boolean isValid(Tree a, Tree b, Tree padding) {
        if ((a == padding) && (b == padding)) {
            return true;
        }
        if ((a == padding) || (b == padding)) {
            return false;
        }
        // no padding
        return a.val == b.val;
    }

    // get all the nodes at next level, adding the spcial "padding" node when a child node is null.
    ArrayList<Tree> getNextLevel(ArrayList<Tree> list, Tree padding) {
        ArrayList<Tree> result = new ArrayList<>();

        for (Tree node : list) {
            if (node == padding) {
                continue;
            }
            if (node.left != null) {
                result.add(node.left);
            } else {
                result.add(padding);
            }

            if (node.right != null) {
                result.add(node.right);
            } else {
                result.add(padding);
            }
        }
        return result;
    }

    // this is how most people implemented. It is a better solution:
    // shorter code, less memory and better performance
    // performance: 85%
    boolean versionB(Tree root) {
        if (root == null) {
            return true;
        }

        return recursionB(root.left, root.right);
    }

    boolean recursionB(Tree a, Tree b) {
        if ((a == null) && (b == null)) {
            return true;
        }
        if ((a == null) || (b == null)) {
            return false;
        }
        if (a.val != b.val) {
            return false;
        }
        return recursionB(a.left, b.right) && recursionB(a.right, b.left);
    }
}
                    


                        Solution in Python : 
                            
# class Tree:
#     def __init__(self, val, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self, root):
        def symmetry(l, r):
            return (l is None and r is None) or bool(
                l
                and r
                and l.val == r.val
                and symmetry(l.left, r.right)
                and symmetry(l.right, r.left)
            )

        return not root or symmetry(root.left, root.right)
                    


View More Similar Problems

QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →