problems/src/Tree/max-depth.js at master · jagatjeevan/problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/**
 * Find the maximum depth of a binary tree.
 *
 * Each node is defined by
 * Node = {
 *  left: Node || null,
 *  right: Node || null,
 *  data: number
 * }
 *
 * Input:
 * {
 *  left: null,
 *  right: {
 *      left: null,
 *      right: null,
 *      data: 2
 *  },
 *  data: 20
 * }
 *
 * The depth is 1.
 *
 * */

var input = {
    left: null,
    data: 1,
    right: {
        left: null,
        data: 2,
        right: {
            left: null,
            data: 21,
            right: {
                left: null,
                data: 4,
                right: {
                    left: null,
                    data: 5,
                    right: null
                },
            },
        },
    },
};


var getDepthOfObj = (obj, level) => {
    if(obj == null){
        return 0;
    }
    if(!obj.left && !obj.right) {
        return level;
    } else if (!obj.left) {
        return getDepthOfObj(obj.right, level + 1);
    } else if (!obj.right) {
        return getDepthOfObj(obj.left, level + 1);
    } else {
        return Math.max(getDepthOfObj(obj.right, level + 1), getDepthOfObj(obj.left, level + 1))
    }

}

console.log(getDepthOfObj(input, 0));