给定一棵二叉查找树和一个新的树节点,将节点插入到树中。
你需要保证该树仍然是一棵二叉查找树。
这道题真的难住我了,难点主要在于挑战说尽量不要用递归,但我想了半天还是没想出办法,只好还是用了递归重建二叉树
class Solution:
"""
@param: root: The root of the binary search tree.
@param: node: insert this node into the binary search tree
@return: The root of the new binary search tree.
"""
def insertNode(self, root, node):
if not root:
root = node;
return node
if root.val > node.val:
if root.left == None:
root.left = node
else:
root.left = self.insertNode(root.left,node)
else:
if root.right == None:
root.right = node
else:
root.right = self.insertNode(root.right,node)
return root