preorder iterator of binary tree

  1. 实现 next(), hasNext() .

Follow up: 实现 remove, remove 要求删除next()last visited node and its subtree.

猜你喜欢

转载自www.cnblogs.com/tobeabetterpig/p/9458296.html