擅长:python、mysql、java
<p>我提供的解决方案在通用的方式,您可以修改代码和名称的类,方法和变量根据您的方便。你知道吗</p>
<pre><code>class BinaryTree:
def __init__(self, root):
self.root = root
self.leftChild = None
self.rightChild = None
def insertLeft(self, node):
if self.leftChild is None:
self.leftChild = BinaryTree(node)
else:
t = BinaryTree(node)
t.leftChild = self.leftChild
self.leftChild = t
def insertRight(self, node):
if self.rightChild is None:
self.rightChild = BinaryTree(node)
else:
t = BinaryTree(node)
t.rightChild = self.rightChild
self.rightChild = t
def getRootValue(self):
return self.root
def getLeftChild(self):
return self.leftChild
def getRightChild(self):
return self.rightChild
bt = BinaryTree(11)
bt.insertLeft(2)
bt.insertRight(13)
print(bt.getRootValue())
print(bt.getLeftChild().getRootValue())
print(bt.getRightChild().getRootValue())
</code></pre>
<p>输出:</p>
<pre><code>11
2
13
</code></pre>
<p>希望这能帮到你。你知道吗</p>