t***u 发帖数: 368 | 1 “Given a binary tree, how would you write program for getting mirror image
of tree in O(n) time? Is it possible ? Assume you have no constraints on
space.” | y*******g 发帖数: 6599 | 2 什么是mirror? 不是直接swap(leftchild, rightchild)吗?
image
【在 t***u 的大作中提到】![](/moin_static193/solenoid/img/up.png) : “Given a binary tree, how would you write program for getting mirror image : of tree in O(n) time? Is it possible ? Assume you have no constraints on : space.”
| t***u 发帖数: 368 | 3 not that straightforward, sounds like ask a way
to duplicate the tree, like we make a mirror ISO file from CD....
【在 y*******g 的大作中提到】![](/moin_static193/solenoid/img/up.png) : 什么是mirror? 不是直接swap(leftchild, rightchild)吗? : : image
| c****p 发帖数: 6474 | 4 这个同样不难吧。
【在 t***u 的大作中提到】![](/moin_static193/solenoid/img/up.png) : not that straightforward, sounds like ask a way : to duplicate the tree, like we make a mirror ISO file from CD....
|
|