摘要：
Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [3,2,1]. Analysis: postorder 阅读全文
posted @ 2016-06-03 10:22
茜茜的技术空间
阅读(157)
评论(0)
推荐(0)
摘要：
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 solut 阅读全文
posted @ 2016-06-03 10:16
茜茜的技术空间
阅读(199)
评论(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 solu 阅读全文
posted @ 2016-06-03 10:11
茜茜的技术空间
阅读(193)
评论(0)
推荐(0)
浙公网安备 33010602011771号