随笔分类 - 递归

平面列表

摘要：遍历列表中元素，如果是整数则添加到数组中，如果是列表则递归遍历该列表。 /** * // This is the interface that allows for creating nested lists. * // You should not implement it, or specula 阅读全文

posted @ 2017-11-05 21:53 叶尘阅读(215) 评论(0) 推荐(0)

子树

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:32 叶尘阅读(328) 评论(0) 推荐(0)

把排序数组转化为高度最小的二叉搜索树

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:28 叶尘阅读(105) 评论(0) 推荐(0)

二叉树的最大深度

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:26 叶尘阅读(186) 评论(0) 推荐(0)

平衡二叉树

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:25 叶尘阅读(97) 评论(0) 推荐(0)

二叉树的后序遍历

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:23 叶尘阅读(117) 评论(0) 推荐(0)

二叉树的中序遍历

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:21 叶尘阅读(126) 评论(0) 推荐(0)

二叉树的前序遍历

摘要：/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left 阅读全文

posted @ 2017-09-18 15:17 叶尘阅读(87) 评论(0) 推荐(0)