tring; for instance (())(()), starting at A and ending at C, has length 8. Your task is to output the nesting depth of the deepest balanced path in the tree. </span></p>
<div>
<div>给出一棵树，每个结点上有一个括号。问在所有括号平衡的路径中，最大嵌套深度为多少。</div>
<div>（最大嵌套深度的大概意思：()()()的最大嵌套深度为1，((()))的最大嵌套深度为3）</div>
</div>
<div></div></div></div></div></div><div class="row"><div class="column"><