Tree Operations 打印出有向图中的环

最新推荐文章于 2024-03-07 19:56:58 发布

he_wolf

最新推荐文章于 2024-03-07 19:56:58 发布

阅读量2k

点赞数 2

分类专栏：全职面试真题

本文链接：https://blog.csdn.net/he_wolf/article/details/38636071

版权

这道题目要求在存在环的二叉树中找出所有的环，并打印出来。你可以从根节点开始，使用节点的left和right指针遍历树，通过节点值来检查是否形成环。提供的例子中，环的路径包括[1, 2, 4]，[5]和[3, 6]。" 119621834,10940365,Android Studio Arctic Fox 稳定版发布：支持Jetpack Compose 1.0,"['Android开发', 'Jetpack Compose', 'Android Studio更新', 'Wear OS开发', '开发工具']

摘要由CSDN通过智能技术生成

题目：

You are given a binary tree with unique integer values on each node. However, the child pointers on each node may point to any other node in the tree including itself, introducing cycles into the binary tree. A cycle is defined when you can traverse back to the same node by following its descendants. Write a function that takes in the root node of the tree and prints out the cycles, if any, in the binary tree. The only operations available on each node are node.left (returns another Node or null), node.right, and node.value (returns the integer value of the node). Pseudocode is fine.

即找出有向图中的环（loop或者cycle），并且全部打印出来。

Example: http://i.imgur.com/7S5fZe5.png