LeetCode--Populating Next Right Pointers in Each Node II
来源:互联网 发布:java 执行命令 带参数 编辑:程序博客网 时间:2024/04/28 23:48
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1 / \ 2 3 / \ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ \ 4-> 5 -> 7 -> 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*> use; use.push(root); while(!use.empty()) { int s = use.size(); for(int i=0; i<s; i++) { TreeLinkNode* t = use.front(); use.pop(); if(i == s-1) t->next = NULL; else t->next = use.front(); if(t->left != NULL) use.push(t->left); if(t->right != NULL) use.push(t->right); } } }};
1 0
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- leetcode 79: Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node ii
- leetcode Populating Next Right Pointers in Each Node II
- 【leetcode】Populating Next Right Pointers in Each Node II
- [Leetcode]Populating Next Right Pointers in Each Node II
- [leetcode] Populating Next Right Pointers in Each Node II
- LeetCode-Populating Next Right Pointers in Each Node II
- LeetCode - Populating Next Right Pointers in Each Node II
- [LeetCode]Populating Next Right Pointers in Each Node II
- leetcode Populating Next Right Pointers in Each Node II
- LeetCode | Populating Next Right Pointers in Each Node II
- [leetcode]Populating Next Right Pointers in Each Node II
- 【LeetCode OJ】Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- Best Time to Buy and Sell Stock
- shell if判断语句 报错:syntax error near unexpected token `elif'
- 建造者模式(Builder)
- hadoop 启动报错 Incompatible clusterIDs in /tmp/hadoop-root/dfs/data: namenode
- 产品经理需掌握的七种武器
- LeetCode--Populating Next Right Pointers in Each Node II
- iOS中NSString和NSData的相互转化
- linux 常用命令
- jQuery easyUI datagrid 增加求和统计行
- win7上eclipse提交mr至hadoop2.6分布式运行错误集锦
- 细谈软件需求分析过程
- GTK入门学习:控件的添加
- Quartz介绍 使用说明
- 用jquery解析JSON数据的方法