sdnu_ray

题解

/ 注册

全部文章 / 题解（共39篇）

题解 | #二叉搜索树的最近公共祖先#

* struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * ...

C++

2022-04-26

0 316

题解 | #判断是不是二叉搜索树#

非递归： * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) ...

C++

2022-04-26

0 307

题解 | #二叉搜索树与双向链表#

非递归： struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ clas...

C++

2022-04-26

0 271

题解 | #二叉搜索树与双向链表#

struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class Sol...

C++

2022-04-26

0 274

题解 | #二叉树的最大深度#

* struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * * @param...

C++

2022-04-25

0 185

题解 | #二叉树的后序遍历#

非递归实现：先按照根右左的顺序遍历，然后再翻转 * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullpt...

C++

2022-04-19

0 305

题解 | #二叉树的后序遍历#

递归算法： * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr)...

C++ C 二叉树

2022-04-19

0 343

题解 | #二叉树的中序遍历#

非递归算法： * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr...

C++ C 二叉树

2022-04-19

0 361

题解 | #二叉树的中序遍历#

* struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * ...

C++

2022-04-18

0 237

题解 | #二叉树的前序遍历#

* struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * ...

C++

2022-04-18

0 267