2016年5月23日

Binary Tree Preorder Traversal

摘要: 1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right... 阅读全文

posted @ 2016-05-23 10:37 RenewDo 阅读(98) 评论(0) 推荐(0) 编辑

Binary Tree Inorder Traversal

摘要: 1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right... 阅读全文

posted @ 2016-05-23 10:02 RenewDo 阅读(124) 评论(0) 推荐(0) 编辑

导航