python图形化输出二叉树_从python中的给定数据生成二叉树

i wanted to know how to read values from a list into a binary tree.

i have a triangle like this:

0

1 2

3 4 5

6 7 8 9

i have written a class node like this

class node:

def __init__(self,data,left=None,right=None):

self.data=data

self.left=left

self.right=right

basically what i want to do is something like this

node(0,node(1),node(2))

i want to make a recursive function that can handle much bigger triangles. Can somehow tell me what i am supposed to do?

edit: quite clearly binary tree is not the way to approach this problem. what i basically want to find out are all the different combination's from top to bottom. like 0,1,3,6 0,2,5,8 etc.

解决方案

This does sound like homework, so I won't write code, but here are a couple of hints:

This could be done even if your triangle were written as a list, like

0 1 2 3 4 5 6 7 8 9

Because it seems like this is a full binary tree (assuming your triangle is wrong and the third row is actually supposed to be 3 4 5 6), you could maintain a parents queue whose head is the next parent that needs children. Note that I am specifically not recommending recursion.

A full binary tree is one where each non-leaf node has exactly two children. If this is not supposed to be a full binary tree, then there is no deterministic way to interpret the problem (since each of node 1 and 2 could have 1 or 2 children, given your picture).