正式放弃种菜# gardening - 拈花惹草
q*x
1 楼
a classical problem, isn't it? anyone knows the answer based on the hint?
Give a nonrecursive algorithm that performs an inorder tree walk. (Hint: An
easy solution uses a stack as an auxiliary data structure. A more
complicated, but elegant, solution uses no stack but assumes that we can
test two pointers for equality.)
Give a nonrecursive algorithm that performs an inorder tree walk. (Hint: An
easy solution uses a stack as an auxiliary data structure. A more
complicated, but elegant, solution uses no stack but assumes that we can
test two pointers for equality.)
