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.

Sign up for GitHub

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

Jump to bottom

先刷二叉树 #36

Open

yudidi opened this issue Jun 11, 2020 · 2 comments

Labels

TODO

Member

yudidi commented Jun 11, 2020 •

edited

Loading

参考,先刷二叉树三、算法刷题指南

https://github.com/P2P-Learning/P2P_Learning/blob/master/%E7%AE%97%E6%B3%95/algo.md#%E4%BA%8C%E5%8F%89%E6%A0%91

二叉查找树 - 删除节点详解

实际上在 3 种情况中，还有一个特例就是删除根节点，后续代码会有处理。

同时存在左右子节点
后继节点前移替换待删除节点。
or
前驱节点后移替换待删除节点。

yudidi added the TODO label

Member Author

yudidi commented Jun 27, 2020

Q: 二叉树遍历的时间复杂度是多少？

Member Author

yudidi commented Aug 5, 2020

为了构造测试用例

需要编写创建指定二叉树的函数。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment