leetcode/problems/validate-binary-tree-nodes/validateBinaryTreeNodes.test.js at master · ecgan/leetcode · 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
const validateBinaryTreeNodes = require('./validateBinaryTreeNodes')

test('Example 1', () => {
  const n = 4
  const leftChild = [1, -1, 3, -1]
  const rightChild = [2, -1, -1, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(true)
})

test('Example 2', () => {
  const n = 4
  const leftChild = [1, -1, 3, -1]
  const rightChild = [2, 3, -1, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})

test('Example 3', () => {
  const n = 2
  const leftChild = [1, 0]
  const rightChild = [-1, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})

test('Example 4', () => {
  const n = 6
  const leftChild = [1, -1, -1, 4, -1, -1]
  const rightChild = [2, -1, -1, 5, -1, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})

test('only one node, no child, should return true', () => {
  const n = 1
  const leftChild = [-1]
  const rightChild = [-1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(true)
})

test('three nodes, first node has no child, should return false', () => {
  const n = 3
  const leftChild = [-1, -1, -1]
  const rightChild = [-1, 2, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})

test('three nodes, first node has two children, should return true', () => {
  const n = 3
  const leftChild = [1, -1, -1]
  const rightChild = [2, -1, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(true)
})

test('right child has node from left child (similar to example 2), should return false', () => {
  const n = 4
  const leftChild = [1, 3, -1, -1]
  const rightChild = [2, -1, 3, -1]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})

test('right child points back to parent (similar to example 3), should return false', () => {
  const n = 2
  const leftChild = [-1, -1]
  const rightChild = [1, 0]

  const result = validateBinaryTreeNodes(n, leftChild, rightChild)

  expect(result).toBe(false)
})