1 题目
类似题目:LeetCode-树-中序遍历(DFS)-展平二叉搜索树_hclbeloved的博客-CSDN博客
2 代码实现
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* inorderSuccessor(TreeNode* root, TreeNode* p) {
if (!root || !p)
return NULL;
queue<TreeNode*> q;
dfs(root, q);
while(!q.empty())
{
TreeNode* tmp = q.front();
q.pop();
if (tmp == p)
{
break;
}
}
return q.empty() ? NULL : q.front();
}
void dfs(TreeNode* root, queue<TreeNode*>& q)
{
if (!root)
return;
dfs(root->left, q);
q.push(root);
dfs(root->right, q);
}
};