-
Notifications
You must be signed in to change notification settings - Fork 167
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
请问如何生成一棵有根树,并以父->子的形式输出 #91
Comments
能不能有除了dfs一遍以外的其他方法? |
Cu Ball |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
就类似于这道题的形式输出树边。每行两个数 a,b 表示 a 是 b 的父亲。
The text was updated successfully, but these errors were encountered: