【LeetCode-cpp】【48】116. 中等 填充每个节点的下一个右侧节点指针 Populating Next Righ Pointers in Each Node
2020-06-08 05:20
447 查看
标签:深度优先搜索
难度:Midium
没什么特别要讲的,还是DFS那一套,重点在下面m和n的处理上。
[code] class Solution { public: Node* connect(Node* root) { if(!root) return root; connect(root->left); connect(root->right); Node* m = root->left; Node* n = root->right; while(m && n){ m->next = n; m = m->right;//左边的向右 n = n->left;//右边的向左 } return root; } };
相关文章推荐
- 【LeetCode-cpp】【49】117. 中等 填充每个节点的下一个右侧节点指针II Populating Next Right Pointers in Each Node II
- 【二叉树的递归】06填充每个节点中的下一个正确的指针【Populating Next Right Pointers in Each Node】
- [LeetCode 116 117] - 填充每一个节点的指向右边邻居的指针I & II (Populating Next Right Pointers in Each Node I & II)
- [LeetCode] 116. Populating Next Right Pointers in Each Node 每个节点的右向指针
- [Leetcode] Populating next right pointer in each node 填充每个节点的右指针
- Leetcode 116 Populating Next Right Pointers in Each Node 二叉树填充next指针指向右侧结点
- leetCode 116.Populating Next Right Pointers in Each Node (为节点填充右指针) 解题思路和方法
- [和小菜鸡一起刷题(python)] LeetCode 116. 填充同一层的兄弟节点(Populating Next Right Pointers in Each Node)
- [LeetCode] Populating Next Right Pointers in Each Node II 每个节点的右向指针之二
- populating-next-right-pointers-in-each-node(填充每个节点中右下角的指针)
- leetCode 116.Populating Next Right Pointers in Each Node (为节点填充右指针) 解题思路和方法
- [LeetCode 116 117] - 填充每一个节点的指向右边邻居的指针I & II (Populating Next Right Pointers in Each Node I & II)
- [LeetCode] Populating Next Right Pointers in Each Node 每个节点的右向指针
- [Leetcode] Populating next right pointer in each node ii 填充每个节点的右指针
- Leetcode 117 Populating Next Right Pointers in Each Node II 二叉树填充next指针指向右侧结点 II
- 【LeetCode】#116填充同一层的兄弟节点(Populating Next Right Pointers in Each Node)
- (Java) LeetCode 116. Populating Next Right Pointers in Each Node —— 填充同一层的兄弟节点
- leetcode-116- 填充同一层的兄弟节点(populating next right pointers in each node
- LeetCode OJ 之 Populating Next Right Pointers in Each Node (为每个结点填充右指针)
- LeetCode-Populating Next Right Pointers in Each Node-填充结点的右指针-二叉树递归