求二叉树的深度(后序遍历)

[{"title":"（ 16 个子文件 176KB ） 求二叉树的深度(后序遍历)","children":[{"title":"TreeDepth","children":[{"title":"TreeDepth.dsp <span style='color:#111;'> 4.15KB </span>","children":null,"spread":false},{"title":"Test.dsw <span style='color:#111;'> 533B </span>","children":null,"spread":false},{"title":"TreeDepth.dsw <span style='color:#111;'> 543B </span>","children":null,"spread":false},{"title":"TreeDepth.ncb <span style='color:#111;'> 25.00KB </span>","children":null,"spread":false},{"title":"Test.opt <span style='color:#111;'> 47.50KB </span>","children":null,"spread":false},{"title":"Test.ncb <span style='color:#111;'> 41.00KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Test.obj <span style='color:#111;'> 6.46KB </span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'> 52.00KB </span>","children":null,"spread":false},{"title":"TreeDepth.exe <span style='color:#111;'> 160.08KB </span>","children":null,"spread":false},{"title":"Test.pdb <span style='color:#111;'> 417.00KB </span>","children":null,"spread":false},{"title":"TreeDepth.pdb <span style='color:#111;'> 329.00KB </span>","children":null,"spread":false},{"title":"Test.exe <span style='color:#111;'> 160.08KB </span>","children":null,"spread":false}],"spread":true},{"title":"TreeDepth.plg <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"Test.plg <span style='color:#111;'> 736B </span>","children":null,"spread":false},{"title":"Test.dsp <span style='color:#111;'> 3.30KB </span>","children":null,"spread":false},{"title":"树的深度.cpp <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]