JavaScript/Trees/MorrisTraversal.js at b8f21059014157a5a0957f301041d62bfa665570 · aniket866/JavaScript · 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
export class Node {
  constructor(data) {
    this.data = data
    this.left = null
    this.right = null
  }
}

export class BinaryTree {
  constructor() {
    this.root = null
  }

  morrisTraversal() {
    const traversal = []
    let current = this.root

    while (current !== null) {
      if (current.left === null) {
        traversal.push(current.data)
        current = current.right
      } else {
        let predecessor = current.left
        while (predecessor.right !== null && predecessor.right !== current) {
          predecessor = predecessor.right
        }

        if (predecessor.right === null) {
          predecessor.right = current
          current = current.left
        } else {
          predecessor.right = null
          traversal.push(current.data)
          current = current.right
        }
      }
    }

    return traversal
  }
}