![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
hustwgp
这个作者很懒,什么都没留下…
展开
-
二叉树中序遍历
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.原创 2021-08-15 11:37:08 · 90 阅读 · 0 评论 -
二叉树后序遍历
class Solution{public: vector<int> v; stack<TreeNode *> s; TreeNode *cur ; void findnext() { while (true) { while (cur->left != nullptr) { cur = cur->left;.原创 2021-08-15 11:36:16 · 46 阅读 · 0 评论 -
二叉树先序遍历
非递归栈1:采用左右子节点入栈/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), rig原创 2021-08-15 10:13:35 · 42 阅读 · 0 评论