如何创建一个二叉树代码示范
时间: 2023-06-09 18:08:00 浏览: 41
可以参考以下代码示范:
```python
class Node:
def __init__(self, val=None):
self.val = val
self.left = None
self.right = None
class BinaryTree:
def __init__(self, root=None):
self.root = root
def insert(self, node):
if not self.root:
self.root = node
else:
queue = [self.root]
while queue:
curr = queue.pop(0)
if curr.left is None:
curr.left = node
break
else:
queue.append(curr.left)
if curr.right is None:
curr.right = node
break
else:
queue.append(curr.right)
def print_inorder(self, node=None):
if node is None:
node = self.root
if node:
self.print_inorder(node.left)
print(node.val, end=" ")
self.print_inorder(node.right)
# create binary tree
bt = BinaryTree()
bt.insert(Node(1))
bt.insert(Node(2))
bt.insert(Node(3))
bt.insert(Node(4))
bt.insert(Node(5))
bt.insert(Node(6))
# print inorder traversal
bt.print_inorder()
```
以上代码创建了一个二叉树,并实现了插入节点和中序遍历的功能。您也可以按照需求修改代码,实现其他功能。