[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
5.9.1 树的遍历
1、先根遍历:若树不为空,则先访问根,然后依次先根遍历各棵子树。
2、后根遍历:若树不为空,则先依次后根遍历各棵子树,然后再访问根结点。
3、层序遍历:若树不为空,则自上而下、自左而右访问树中的每个结点。
树的先根遍历序列是:ABCDE。
树的后根遍历序列是:BDCEA。
树的层序遍历序列是:ABCED。
5.9.2 森林的遍历
将森林看作三部分构成:
(1)森林中第一棵树的根结点;
(2)森林中第一棵树的子树森林;
(3)森林中其它树构成的森林。
先序遍历:
若森林不为空,则:
(1)访问森林中第一棵树的根结点;
(2)先序遍历森林中第一棵树的子树森林;
(3)先序遍历森林中(除第一棵树外)其余树构成的森林。
先序遍历上图中的森林,它的遍历序列是:ABCDEFGHIJ
中序遍历:
若森林不为空,则:
(1)中序遍历森林中第一棵树的子树森林;
(2)访问森林中第一棵树的根结点;
(3)中序遍历森林中(第一棵树之外)其余树构成的森林。
中序遍历上图中的森林,它的遍历序列是:BCDAFEHJIG。
后序遍历:
若森林不为空,则:
(1)后根遍历森林中第一棵树的子树森林;
(2)访问森林中第一棵树的根结点;
(3)后序遍历森林中(第一棵树之外)其余树构成的森林。
后序遍历上图中的森林,它的遍历序列是:BCDAFEHJIG。
可以发现其实森林的中序遍历和后序遍历的序列是一样的。