劍指Offer——JZ38.二叉樹的深度

題目傳送門web 題解 sb題，很少bb AC-Code /* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class Solution { public: int Tr

>>阅读原文<<