Coming680

题解

/ 注册

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

题解 | #实现二叉树先序，中序和后序遍历#

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

C++ 深度优先搜索二叉树

2022-03-06

0 300

题解 | #二叉树的镜像#

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

C++ 深度优先搜索二叉树

2022-03-06

0 306

题解 | #判断是不是平衡二叉树#

class Solution { public: bool result = true; int dfs(TreeNode* pRoot){ if(pRoot == NULL) return 0; int left = dfs(...

C++ 深度优先搜索二叉树

2022-03-06

0 299