How to convert list to binary tree in Python

Python how to convert the list into a binary tree, many novices are not very clear about this, in order to help you solve this problem, the following editor will explain in detail for you, people with this need can come to learn, I hope you can gain something.

Day46: converting lists to binary trees

Given the list nums, convert it to a binary tree. For example:

Nums = [3pd9, 20pr, nonepr, nonewag7], after being transformed into a binary tree:

The left child node 9 of node 3 and the left and right child nodes of node 20 are both left child node 15 and right child node 7 of None,20. Refer to the following:

Binary tree definition:

Class TreeNode:

Def _ _ init__ (self, x):

Self.val = x

Self.left = None

Self.right = None

Please complete the following functions:

Def list_to_binarytree (nums):

Pass

Construction and analysis

By building a binary tree that satisfies the above structure, we can observe the relationship between the parent node and the left and right child nodes of the tree:

Based on the above formula, the binary tree is constructed by recursion.

Recursive basis:

If index > = len (nums) or nums [index] is None:

Return None

Recursive equation:

According to the above, we get the following code:

Code def list_to_binarytree (nums):

Def level (index):

If index > = len (nums) or nums [index] is None:

Return None

Root = TreeNode (nums [index])

Root.left = level (2 * index + 1)

Root.right = level (2 * index + 2)

Return root

Return level (0)

Binary_tree = list_to_binarytree ([3, 9, 10, 20, 7, 15, 7])

Is it helpful for you to read the above content? If you want to know more about the relevant knowledge or read more related articles, please follow the industry information channel, thank you for your support.