比较两个树是否完全相同

两种比较树是否相同的Python代码实现如下所示：

代码1：

class Node:
	_value = ""
	_left = None
	_right = None
	def hasLeftChild(self):
		if (self._left != None):
			return True
		else:
			return False
	def hasRightChild(self):
		if (self._right != None):
			return True
		else:
			return False

			
			
def _is_identical_aux(node1, node2):
	if node1._value != node2._value:
		return False
	if node1.hasLeftChild() and node1.hasLeftChild():
		return _is_identical_aux(node1._left, node2._left)
	elif not (node1.hasLeftChild() or node1.hasLeftChild()):
		pass
	else:
		return False
	
	if node1.hasRightChild() and node1.hasRightChild():
		return _is_identical_aux(node1._left, node2._left)
	elif not (node1.hasRightChild() or node1.hasRightChild()):
		pass
	else:
		return False
		
	return True

node1 =  Node()
node1._value = "A"
node1._left = Node()
node1._left._value = "B"
node1._right = Node()
node1._right._value = "C"
node1._right._left = Node()
node1._right._left._value = "E"
node1._right._right = Node()
node1._right._right._value = "F"

node2 =  Node()
node2._value = "A"
node2._left = Node()
node2._left._value = "B"
node2._right = Node()
node2._right._value = "C"
node2._right._left = Node()
node2._right._left._value = "E"
node2._right._right = Node()
node2._right._right._value = "F"


print (_is_identical_aux(node1, node2))

代码2：

class Node:
    def __init__(self, data):
        self._value = data
        self.left = None
        self.right = None

def _is_identical_aux(node1, node2):
    if node1 is None and node2 is None:
        return True
    if node1 is not None and node2 is not None:
        return ((node1._value == node2._value) and
                _is_identical_aux(node1.left, node2.left) and
                _is_identical_aux(node1.right, node2.right))
    return False

root1 = Node(7)
root1.left = Node(3)
root1.right = Node(2)
root1.left.left = Node(123)
root1.left.right = Node(231)
root1.right.left = Node(9)
root1.right.right = Node(5)

root2 = Node(7)
root2.left = Node(3)
root2.right = Node(2)
root2.left.left = Node(123)
# root2.left.right = Node(231)
root2.right.left = Node(9)
root2.right.right = Node(5)

root3 = Node(7)
root3.left = Node(3)
root3.right = Node(2)

if _is_identical_aux(root1, root2):
    print "Both trees are identical"
else:
    print "Trees are not identical"

if _is_identical_aux(root1, root3):
    print "Both trees are identical"
else:
    print "Trees are not identical"

首先，两段代码设计的树的存储结构比较类似。代码1中实现了判断是否有左右子树（孩子）的方法，代码2中则没有判断。其次，关于迭代的实现。代码1循规蹈矩，按照当前节点的值是否相同，是否都有左孩子、右孩子，其孩子节点的值是否相同，进行判断。在判断时，调用了Node class中实现的函数。代码2思路比较独特，直接将当前节点是否有后继节点继续判断。如果两个当前节点都没有后继节点，则返回True。否则继续比较当前节点的值和后继节点。一旦当前节点的值不同，或者后继节点不匹配，则返回False。其写法很简洁。