Leetcode: fill in the next right node of each node (Python)

A good function 2020-11-13 02:53:49
leetcode right node node python

1. Title Description

Given a perfect binary tree , All its leaf nodes are on the same layer , Each parent node has two children . A binary tree is defined as follows :

struct Node {
int val;
Node *left;
Node *right;
Node *next;

Fill in each of its next The pointer , Let this pointer point to its next right node . If the next right node cannot be found , Will next The pointer is set to NULL.

In the initial state , all next The pointer is set to NULL.

Example :
 Insert picture description here

explain : A given binary tree is shown in figure A Shown , Your function should fill in every one of its next The pointer , To point to its next right node , Pictured B Shown .

Tips :
You can only use constant level extra space .
Using recursion to solve problems also meets the requirements , In this problem, the stack space occupied by recursive program is not considered as additional space complexity .

2. Ideas

Because it's a perfect binary tree , Therefore, there is no need to worry about the left subtree and the right subtree , You don't have to worry about a node having a subtree , However, the nodes in the same layer have no subtrees . That is to say, there should be everything , If not, none of them .

2.1 recursive

For recursion , Be sure to establish the relationship between the right and left subtrees of adjacent nodes , otherwise , Of the right subtree of each node next Will be None, That is, if the parent node has Next Node words , Of the right subtree of the parent node next Is the parent node next The left subtree of the node , So that we can make connections .

2.1 python Code

# Definition for a Node.
class Node:
def __init__(self, val, left, right, next):
self.val = val
self.left = left
self.right = right
self.next = next
class Solution:
def connect(self, root: 'Node') -> 'Node':
if root == None:
return None
if root.left == None:
return root
root.left.next = root.right
if root.next: # If root.next exist 
root.right.next = root.next.left
return root

2.2 Non recursive

Non recursive words , You can actually go through the queue , To traverse hierarchically , But in that case , Beyond the limits of space complexity .
At each layer of nodes next Nodes are set from the far left , So you need to set a pointer that indicates the leftmost parent node of each layer preNode. Make every cycle from preNode.left At the beginning . For a certain layer , Set from left to right , Each time you need to check whether the parent node has next, If there is one , Create the right child of the parent node and the parent node next The connection between the left subtree of a node .

2.2 python Code

# Definition for a Node.
class Node:
def __init__(self, val, left, right, next):
self.val = val
self.left = left
self.right = right
self.next = next
class Solution:
def connect(self, root: 'Node') -> 'Node':
if root == None:
return None
preNode = root # Record the information of the leftmost node 
curNode = root # Record the information of the parent node of the current child node and update it at any time 
while True:
if curNode.left:
curNode.left.next = curNode.right
if curNode.next: # Check whether the parent node has next, If there's a connection ,
# It also shows that this layer has not been modified , modify curNode For its next node 
curNode.right.next = curNode.next.left
curNode = curNode.next
else: # without next The node , This indicates that this layer has been modified ,
# modify curNode To the left most child node of the next layer , At the same time to modify preNode,
curNode = preNode.left
preNode = curNode
else: # If curNode.left non-existent , It's the last layer , Interruption cycle 
return root
本文为[A good function]所创,转载请带上原文链接,感谢

  1. 利用Python爬虫获取招聘网站职位信息
  2. Using Python crawler to obtain job information of recruitment website
  3. Several highly rated Python libraries arrow, jsonpath, psutil and tenacity are recommended
  4. Python装饰器
  5. Python实现LDAP认证
  6. Python decorator
  7. Implementing LDAP authentication with Python
  8. Vscode configures Python development environment!
  9. In Python, how dare you say you can't log module? ️
  10. 我收藏的有关Python的电子书和资料
  11. python 中 lambda的一些tips
  12. python中字典的一些tips
  13. python 用生成器生成斐波那契数列
  14. python脚本转pyc踩了个坑。。。
  15. My collection of e-books and materials about Python
  16. Some tips of lambda in Python
  17. Some tips of dictionary in Python
  18. Using Python generator to generate Fibonacci sequence
  19. The conversion of Python script to PyC stepped on a pit...
  20. Python游戏开发,pygame模块,Python实现扫雷小游戏
  21. Python game development, pyGame module, python implementation of minesweeping games
  22. Python实用工具,email模块,Python实现邮件远程控制自己电脑
  23. Python utility, email module, python realizes mail remote control of its own computer
  24. 毫无头绪的自学Python,你可能连门槛都摸不到!【最佳学习路线】
  25. Python读取二进制文件代码方法解析
  26. Python字典的实现原理
  27. Without a clue, you may not even touch the threshold【 Best learning route]
  28. Parsing method of Python reading binary file code
  29. Implementation principle of Python dictionary
  30. You must know the function of pandas to parse JSON data - JSON_ normalize()
  31. Python实用案例,私人定制,Python自动化生成爱豆专属2021日历
  32. Python practical case, private customization, python automatic generation of Adu exclusive 2021 calendar
  33. 《Python实例》震惊了,用Python这么简单实现了聊天系统的脏话,广告检测
  34. "Python instance" was shocked and realized the dirty words and advertisement detection of the chat system in Python
  35. Convolutional neural network processing sequence for Python deep learning
  36. Python data structure and algorithm (1) -- enum type enum
  37. 超全大厂算法岗百问百答(推荐系统/机器学习/深度学习/C++/Spark/python)
  38. 【Python进阶】你真的明白NumPy中的ndarray吗?
  39. All questions and answers for algorithm posts of super large factories (recommended system / machine learning / deep learning / C + + / spark / Python)
  40. [advanced Python] do you really understand ndarray in numpy?
  41. 【Python进阶】Python进阶专栏栏主自述:不忘初心,砥砺前行
  42. [advanced Python] Python advanced column main readme: never forget the original intention and forge ahead
  43. python垃圾回收和缓存管理
  44. java调用Python程序
  45. java调用Python程序
  46. Python常用函数有哪些?Python基础入门课程
  47. Python garbage collection and cache management
  48. Java calling Python program
  49. Java calling Python program
  50. What functions are commonly used in Python? Introduction to Python Basics
  51. Python basic knowledge
  52. Anaconda5.2 安装 Python 库(MySQLdb)的方法
  53. Python实现对脑电数据情绪分析
  54. Anaconda 5.2 method of installing Python Library (mysqldb)
  55. Python implements emotion analysis of EEG data
  56. Master some advanced usage of Python in 30 seconds, which makes others envy it
  57. python爬取百度图片并对图片做一系列处理
  58. Python crawls Baidu pictures and does a series of processing on them
  59. python链接mysql数据库
  60. Python link MySQL database