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

剑指Offer #13

Open

Bryce1010 opened this issue Apr 22, 2020 · 1 comment

Owner

Bryce1010 commented Apr 22, 2020

目录

https://github.com/YaxeZhang/Just-Code

Owner Author

Bryce1010 commented Apr 22, 2020 •

edited

Loading

二叉树的下一个结点 [problem]

给定一个二叉树和其中的一个结点，请找出中序遍历顺序的下一个结点并且返回
分为两部分: 如果存在右孩子节点, 那么是右孩子的最左孩子; 如果没有右孩子没有左孩子, 那么是他自己;
如果没有右孩子, 那么找父节点, 找出第一个非父节点;
10.斐波那契数列 [problem]

斐波那契的记忆化优化

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