找到二叉树最大深度的递归机制非常简单,但是我们如何有效地不递归地完成它,因为我有一个大树,我宁愿避免这种递归。//Recursive mechanism which I want to replace with non-recursiveif (node == null) return 0;
return 1 + Math.max(maxDepth(node.left), <e
只是为了避免太多的阅读和太多的争论失败。 find: warning: you have specified the -maxdepthoption after a non-option argument -name, but options are not positional (-maxdepth affects tests specifiedfind: