Populating Next Right Pointers in Each Node
来源:互联网 发布:mac地址无法修改 编辑:程序博客网 时间:2024/05/22 14:31
Populating Next Right Pointers in Each Node
Given a binary tree
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL
.
Initially, all next pointers are set to NULL
.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL解析:
按层遍历二叉树,维护一个队列结构,对于每一层前一个节点指向后面一个节点,每一行的最后一个节点指向NULL。
代码:
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {} * }; */class Solution {public: void connect(TreeLinkNode *root) { if (root==NULL) return ; queue<TreeLinkNode *>node; node.push(root); while(!node.empty()) { int cnt=node.size(); for (int i=0; i<cnt-1; i++) { TreeLinkNode* temp=node.front(); node.pop(); if (temp->left) { node.push(temp->left); node.push(temp->right); } temp->next=node.front(); } TreeLinkNode* temp=node.front(); node.pop(); if (temp->left) { node.push(temp->left); node.push(temp->right); } temp->next=NULL; } return ; }};
0 0
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- C++第一课
- ecshop前台分页功能
- install hadoop in docker
- UESTC
- Jquery(三)
- Populating Next Right Pointers in Each Node
- 两张背景图无间隙移动
- HTML5 canvas入门实例
- int,long long 的快速输入
- 想从事IT行业的你,一定看看这篇文章
- 子串和再续
- 基于jackson注释@JsonFormat 格式化时间少8小时
- linux-ubuntu使用shadowsocks客户端配置
- 某个页面强制横屏