题目内容

补充下面的程序：（完全二叉树的建立）def tree_build(input):class TreeNode:def init(self, val):self.val = valself.left = Noneself.right= Nonetree =cnt =for item in :tmp = TreeNode(item)tree.append(tmp)for item in tree:if item == 0:continueif != None:if 2cnt <= :if != None:= 2 cntif (2cnt+1) <= len(input):if tree[2cnt+1].val != None:item.right = 2 * cnt + 1cnt = cnt + 1return tree

查看答案

搜索结果不匹配？点我反馈

更多问题

补充下列程序：（先序遍历）def preorder(i):if tree[i] == 0:returnif i <= len(tree)-1:print()if 2i <= len(tree) - 1:preorder()if 2i+1 <= len(tree) - 1:preorder()

补充下列程序：（二叉搜索树）def search(node,data):if == None:return 0,Noneelse:print(tree[node].val)if tree[node].val == data:return 1,nodeif tree[node].val > data:if == None:return 0,Nonereturn search(,data)else:if == None:return 0,Nonereturn search(,data)

一棵树可以有2个根节点。

A. 对
B. 错

在一棵树中，非根节点可以有2个父亲节点。

A. 对
B. 错