简单就好201710200501870

分类

题解(20)

/ 注册

全部文章（共52篇）

题解 | #二叉树的深度#

class Solution { public: int TreeDepth(TreeNode* pRoot) { if(pRoot == NULL) return 0; return max(1+TreeDepth(pRoot->...

2021-07-27

0 388

题解 | #二叉树的镜像#

struct TreeNode* Mirror(struct TreeNode* pRoot ) { // write code here if(pRoot == NULL) return pRoot; struct TreeNode* tmp = NULL;...

2021-07-27

0 462