这次要记录的是做leetbook：二叉树的经历，这是一本很小的book，所以决定用一晚上的时间做完。传送门 树的遍历 t1 二叉树的先序遍历 常规操作，简单题要做难，所以考虑用多种方法来写。 递归法 最常规的递归法，按照根->左->右的顺序来写就可以了。 迭代法 迭代法是用栈模拟递归的操作。因为栈具有先入后……
来自分类：做题
你已到达了世界的尽头(｡・`ω´･)！
-
edisoncgh
最近访客
评论
-
于「4年前」在「互换友链」中说:
-
于「4年前」在「互换友链」中说:( ,,´･ω･)ﾉ"(´っω･｀｡)
-
于「4年前」在「poj2524：Ubiquitous Religions」中说:Hello there! This is my 1st comment here so I just wanted to give a quick shout out and say I really enjoy reading through your articles. Can you suggest any other blogs/websites/forums that cover the same subjects? Thank you!
-
于「4年前」在「C++Trie树(字典树)」中说:I wish to point out my passion for your generosity giving support to people who require help with your situation. Your special commitment to passing the solution around appears to be pretty significant and have usually made people like me to get to their aims. The important facts signifies a whole lot a person like me and a whole lot more to my fellow workers. Many thanks; from everyone of us. Frannie Prentiss Langille
-
于「4年前」在「C++Trie树(字典树)」中说:Awesome post. I am a regular visitor of your blog and appreciate you taking the time to maintain the excellent site. I will be a frequent visitor for a long time. Manon Cornie Elwina
-
