标签:dfs result getc code bsp root pre rgb nbsp
算是第一个独立完成的中等题了。对二叉树进行一次先序遍历即可。
class Solution { public: TreeNode *targetNode; TreeNode *resultNode; TreeNode *getTargetCopy(TreeNode *original, TreeNode *cloned, TreeNode *target) { targetNode = target; bool res = dfs(cloned); return resultNode; } bool dfs(TreeNode *root) { if (root == NULL) return false; if (root->val == targetNode->val) { resultNode = root; return true; } if (root->left != NULL) dfs(root->left); if (root->right != NULL) dfs(root->right); return false; } };
标签:dfs result getc code bsp root pre rgb nbsp
原文地址:https://www.cnblogs.com/siyu1915/p/14448491.html