转载：二叉树遍历算法

最新推荐文章于 2024-01-01 17:25:38 发布

GUO_z_y

最新推荐文章于 2024-01-01 17:25:38 发布

阅读量193

点赞数

文章标签： python 二叉树

原文链接：https://blog.csdn.net/u013632755/article/details/102763152

版权

转载：本文链接： https://blog.csdn.net/u013632755/article/details/102763152

文章目录

前言

二叉树的遍历是指从根节点触发，按照某种次序依次访问二叉树中所有的节点。
由于不同于线性结构，二叉树达到一个节点需要选择两个子节点的先后顺序，所有遍历方式有很多。

二叉树遍历方法

二叉树遍历方式有很多，所以如下介绍的遍历方式，我们约定从左往右进行遍历。
我们需要遍历的树结构如下：
在这里插入图片描述
下面的遍历算法用Python实现，不会Python的同学不用担心，因为算法逻辑很简单。
先看下我们的节点对象的定义：

class TreeNode:
<span class="token keyword">def</span> <span class="token function">__init__</span><span class="token punctuation">(</span>self<span class="token punctuation">,</span> data<span class="token punctuation">)</span> <span class="token operator">-</span><span class="token operator">&gt;</span> <span class="token boolean">None</span><span class="token punctuation">:</span>
    self<span class="token punctuation">.</span>data <span class="token operator">=</span> data  <span class="token comment"># 数据</span>
    self<span class="token punctuation">.</span>left <span class="token operator">=</span> <span class="token boolean">None</span>  <span class="token comment"># 左子节点</span>
    self<span class="token punctuation">.</span>right <span class="token operator">=</span> <span class="token boolean">None</span>  <span class="token comment"># 右子节点</span>

前序遍历

在这里插入图片描述
前序遍历算法，采用递归，先判断节点是否为空，如果为空则返回。先打印当前节点内容，然后依次递归所有左子节点，再依次递归所有右子节点。遍历顺序为：ABDGHCEIF
递归算法如下：

def pre_order_traverse(_binary_tree):
    """
    前序遍历
    :param _binary_tree: 二叉树
    :type _binary_tree: TreeNode
    """
    if _binary_tree is None:
        return
    print(_binary_tree.data, end='')
    pre_order_traverse(_binary_tree.left)
    pre_order_traverse(_binary_tree.right)

 
 
 
 1
2
3
4
5
6
7
8
9
10
11

中序遍历

在这里插入图片描述
中序遍历算法，采用递归，先判断节点是否为空，如果为空则返回。先依次递归所有左子节点，然后打印当前节点内容，再递归所有右子节点。
遍历顺序为：GDHBAEICF
递归算法如下：

def in_order_traverse(_binary_tree):
    """
    中序遍历
    :param _binary_tree: 二叉树
    :type _binary_tree: TreeNode
    """
    if _binary_tree is None:
        return
    in_order_traverse(_binary_tree.left)
    print(_binary_tree.data, end='')
    in_order_traverse(_binary_tree.right)

 
 
 
 1
2
3
4
5
6
7
8
9
10
11

后序遍历

在这里插入图片描述
后序遍历算法，采用递归，先判断节点是否为空，如果为空则返回。先依次递归所有左子节点，再递归所有右子节点，最后打印当前节点内容。
遍历顺序为：GHDBIEFCA
递归算法如下：

def post_order_traverse(_binary_tree):
    """
    后序遍历
    :param _binary_tree: 二叉树
    :type _binary_tree: TreeNode
    """
    if _binary_tree is None:
        return
    post_order_traverse(_binary_tree.left)
    post_order_traverse(_binary_tree.right)
    print(_binary_tree.data, end='')

 
 
 
 1
2
3
4
5
6
7
8
9
10
11

按层遍历

在这里插入图片描述
按层遍历算法，我们将每层所有节点作为列表，传入函数进行递归，先传入列表是否为空，如果为空则返回。声明一个下一层级的子集列表。依次循环当前传入的节点列表，并打印节点数据，将当前节点左节点添加到下一层级的子集列表中，然后添加右节点。
最终遍历顺序为：ABCDEFGHI
递归算法如下：

def layer_order_traverse(_layer_nodes):
    """
    按层遍历
    :param _layer_nodes: 当前层节点集合
    :type _layer_nodes: list
    """
    if _layer_nodes is None or len(_layer_nodes) == 0:
        return
    _childs = []  # 子集
    for _node in _layer_nodes:  # 遍历传入的当前层所有节点
        print(_node.data, end='')
        if _node.left:
            _childs.append(_node.left)
        if _node.right:
            _childs.append(_node.right)
    layer_order_traverse(_childs)

 
 
 
 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

代码

class TreeNode:
<span class="token keyword">def</span> <span class="token function">__init__</span><span class="token punctuation">(</span>self<span class="token punctuation">,</span> data<span class="token punctuation">)</span> <span class="token operator">-</span><span class="token operator">&gt;</span> <span class="token boolean">None</span><span class="token punctuation">:</span>
    self<span class="token punctuation">.</span>data <span class="token operator">=</span> data  <span class="token comment"># 数据</span>
    self<span class="token punctuation">.</span>left <span class="token operator">=</span> <span class="token boolean">None</span>  <span class="token comment"># 左子节点</span>
    self<span class="token punctuation">.</span>right <span class="token operator">=</span> <span class="token boolean">None</span>  <span class="token comment"># 右子节点</span>

def fixed_tree():
“”"
返回固定二叉树结构
:return:
“”"
a = TreeNode(‘A’)
b = TreeNode(‘B’)
c = TreeNode(‘C’)
d = TreeNode(‘D’)
e = TreeNode(‘E’)
f = TreeNode(‘F’)
g = TreeNode(‘G’)
h = TreeNode(‘H’)
i = TreeNode(‘I’)
a.left = b
a.right = c
b.left = d
c.left = e
c.right = f
d.left = g
d.right = h
e.right = i
return a

def pre_order_traverse(_binary_tree):
“”"
前序遍历
:param _binary_tree: 二叉树
:type _binary_tree: TreeNode
“”"
if _binary_tree is None:
return
print(_binary_tree.data, end=’’)
pre_order_traverse(_binary_tree.left)
pre_order_traverse(_binary_tree.right)

def in_order_traverse(_binary_tree):
“”"
中序遍历
:param _binary_tree: 二叉树
:type _binary_tree: TreeNode
“”"
if _binary_tree is None:
return
in_order_traverse(_binary_tree.left)
print(_binary_tree.data, end=’’)
in_order_traverse(_binary_tree.right)

def post_order_traverse(_binary_tree):
“”"
后序遍历
:param _binary_tree: 二叉树
:type _binary_tree: TreeNode
“”"
if _binary_tree is None:
return
post_order_traverse(_binary_tree.left)
post_order_traverse(_binary_tree.right)
print(_binary_tree.data, end=’’)

def layer_order_traverse(_layer_nodes):
“”"
按层遍历
:param _layer_nodes: 当前层节点集合
:type _layer_nodes: list
“”"
if _layer_nodes is None or len(_layer_nodes) == 0:
return
_childs = [] # 子集
for _node in _layer_nodes: # 遍历传入的当前层所有节点
print(_node.data, end=’’)
if _node.left:
_childs.append(_node.left)
if _node.right:
_childs.append(_node.right)
layer_order_traverse(_childs)

if name == ‘main’:
binary_tree = fixed_tree()
print(‘前序遍历：’, end=’’)
pre_order_traverse(binary_tree)
print()
print(‘中序遍历：’, end=’’)
in_order_traverse(binary_tree)
print()
print(‘后序遍历：’, end=’’)
post_order_traverse(binary_tree)
print()
print(‘按层遍历：’, end=’’)
layer_order_traverse([binary_tree])

                                </div>
            <link href="https://csdnimg.cn/release/phoenix/mdeditor/markdown_views-e9f16cbbc2.css" rel="stylesheet">
                </div>