JS二叉树前序遍历中序遍历后序遍历

我又来了，这次为大家带来关于二叉树的内容

首先，先来一个简单的二叉树
图有点抽象，大家尽量看，哈哈

这次讲的是二叉树的遍历

分为：前序遍历、中序遍历、后序遍历

一、前序遍历

先根次序遍历

先打印当前，再打印左边，再打印右边

如上图所示，遍历打印顺序：ABCDEFG

上代码：

function Node(value) {
    this.value = value
    this.left = null
    this.right = null
}
let a = new Node('A')
let b = new Node('B')
let c = new Node('C')
let d = new Node('D')
let e = new Node('E')
let f = new Node('F')
let g = new Node('G')

a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
c.right = g

function bianli(root) {
    if (root === null) return
    console.log(root.value)
    bianli(root.left)
    bianli(root.right)
}
bianli(a)

二、中序遍历

中根次序遍历

先打印左边，再打印当前，再打印右边

遍历顺序：DBEAFCG

function Node(value) {
    this.value = value
    this.left = null
    this.right = null
}
let a = new Node('A')
let b = new Node('B')
let c = new Node('C')
let d = new Node('D')
let e = new Node('E')
let f = new Node('F')
let g = new Node('G')

a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
c.right = g

function bianli(root) {
    if (root === null) return
    bianli(root.left)
    console.log(root.value)
    bianli(root.right)
}
bianli(a)

三、后序遍历

后根次序遍历

先打印左边，再打印右边，再打印当前

遍历顺序：DEBFGCA

function Node(value) {
    this.value = value
    this.left = null
    this.right = null
}
let a = new Node('A')
let b = new Node('B')
let c = new Node('C')
let d = new Node('D')
let e = new Node('E')
let f = new Node('F')
let g = new Node('G')

a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
c.right = g

function bianli(root) {
    if (root === null) return
    bianli(root.left)
    bianli(root.right)
    console.log(root.value)
}
bianli(a)

学无止境，加油！