摘要: Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree{1,#,2,3}, return[1,3,2]. Note: Recursive solutio 阅读全文
posted @ 2017-06-07 17:06 王大咩的图书馆 阅读(502) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree{1,#,2,3}, return[1,2,3]. Note: Recursive soluti 阅读全文
posted @ 2017-06-07 15:41 王大咩的图书馆 阅读(942) 评论(0) 推荐(0) 编辑