摘要:
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 @ 2018-03-01 07:27
轻风舞动
阅读(440)
评论(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 @ 2018-03-01 06:24
轻风舞动
阅读(1247)
评论(0)
推荐(0)

浙公网安备 33010602011771号