Second Place - Amazon Top Interview Questions


Problem Statement :


Given a binary tree root, return the depth of the second deepest leaf. Note that if there are multiple deepest leaves, the second deepest leaf is the next highest one.

The root has a depth of 0 and you can assume the answer is guaranteed to exist for the trees given.

Constraints

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

Example 1

Input

root = [1, [2, null, null], [3, [4, [6, null, null], null], [5, null, [7, null, null]]]]

Output

1

Explanation

The the second deepest leaf is 2 which exists at depth 1


Solution :



title-img 




                        Solution in C++ :

int solve(Tree* root) {
    queue<Tree*> q;
    q.push(root);

    int depth = 0;
    int deepest = 0;
    int res = 0;
    while (!q.empty()) {
        int n = q.size();
        while (n--) {
            Tree* t = q.front();
            q.pop();

            if (t->left == t->right) {
                if (depth > deepest) {
                    res = deepest;
                    deepest = depth;
                } else if (depth > res and depth < deepest)
                    res = depth;
            }

            if (t->left) q.push(t->left);
            if (t->right) q.push(t->right);
        }
        depth++;
    }

    return res;
}
                    


                        Solution in Java :

import java.util.*;

/**
 * public class Tree {
 *   int val;
 *   Tree left;
 *   Tree right;
 * }
 */
class Solution {
    int max1 = -1, max2 = -1;

    public void dfs(Tree root, int depth) {
        if (root == null)
            return;
        this.dfs(root.left, depth + 1);
        this.dfs(root.right, depth + 1);
        if (root.left == null && root.right == null)
            if (depth == max1)
                return;
            else if (depth > max1) {
                max2 = max1;
                max1 = depth;
            } else if (depth > max2)
                max2 = depth;
    }

    public int solve(Tree root) {
        dfs(root, 0);
        return max2;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, root):
        depths = set()

        def dfs(node, d=0):
            if node:
                if not node.left and not node.right:
                    depths.add(d)
                dfs(node.left, d + 1)
                dfs(node.right, d + 1)

        dfs(root)
        depths.discard(max(depths))
        return max(depths)


View More Similar Problems

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 →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →