C语言数据结构题基础不行，实在是不怎么会1.构建上图二叉树2. 实现该二叉树的深度优先遍历(DFS)并输出结果3. 实现该二叉树的广度优先遍历(BFS)并输出结果
https://blog.csdn.net/weixin_37901561/article/details/105499250?spm=1001.2101.3001.6661.1&utm_medium=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7EBlogCommendFromBaidu%7ERate-1-105499250-blog-104790997.pc_relevant_recovery_v2&depth_1-utm_source=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7EBlogCommendFromBaidu%7ERate-1-105499250-blog-104790997.pc_relevant_recovery_v2&utm_relevant_index=1
参考
