#######################- Printing -#################################

import copy
# Check tree
def is_identical_tree_rec(node1, node2):
	if node1 == None and node2 == None:
		return True
	elif node1 != None and node2 != None:
		return ((node1.data == node2.data) and is_identical_tree_rec(node1.left, node2.left) and is_identical_tree_rec(node1.right, node2.right))
	else:
		return False

def is_identical_tree(treeRoot1, treeRoot2):
	return is_identical_tree(treeRoot1, treeRoot2)
	
# TREE TRAVERSAL PRINT CODE
def get_lvl_order(root):
	if (root == None):
		return "None"
	else:
		queue = []
		level_order_list = []

		queue.append(root)
		result = ""
		while (len(queue)):
			temp = queue[0]
			queue.pop(0)

			# print("level_order_list: ", level_order_list)
			level_order_list.append(temp.data)
			if (temp.left != None):
				queue.append(temp.left)
    
			if (temp.right != None):
				queue.append(temp.right)
    
		for i in range(len(level_order_list)):
			result += str(level_order_list[i])
			if (i < len(level_order_list) - 1):
				result += ", "
		return result

def get_in_order_rec(node, res):
	if (node == None):
		return res
	else:
		res = get_in_order_rec(node.left, res)
		res += str(len(res)) + str(node.data) + ", "
		res= get_in_order_rec(node.right, res)
		return res

def get_in_order(root):
	if (root == None):
		return "None"
	else:
		res = ""
		res = get_in_order_rec(root, res)
		return str(res)

# TREE GRAPIC PRINT CODE

# Display List Code Below:
def height(node):
	if (node == None):
		return 0
	return 1 + max(height(node.left), height(node.right))

def draw_node(output, link_above, node, level, p, link_char):
	if (node == None): 
 		return

	out = "["
	h = len(output)
	SP = " "

	if (p < 0):
		for s in output:
			if (s):
				s = " "*(-1*p) + s
    
		for s in link_above:
			if (s):
				s = " "*(-1*p) + s

	if level < h - 1:
		p = max(p, len(output[level + 1]))
	if (level > 0):
		p = max(p, len(output[level - 1]))
	p = max(p, len(output[level]))

	# Fill in to left
	if (node.left):
		leftData = SP + str(node.left.data) + SP
		draw_node(output, link_above, node.left, level + 1, p - len(leftData),'L')
		p = max(p, len(output[level + 1]))

	# Enter this data
	space = p - len(output[level])
	if (space > 0):
		output[level] += (' ' * space)
	node_data = SP + str(node.data) + SP
	output[level] += node_data

	# Add vertical link above
	space = p + len(SP) - len(link_above[level])
	if (space > 0):
		link_above[level] += (' ' * space)
	link_above[level] += link_char

	# Fill in to right
	if (node.right):
		draw_node(output, link_above, node.right, level + 1, len(output[level]),'R')
  
def display_tree(root):
	if (root == None):
		print("\tNone")
	h = height(root)
	output = []
	link_above = []
	for i in range(0,h): 
				output.append("")
				link_above.append("")
	draw_node(output, link_above, root, 0, 5, ' ')

	# Create link lines
	for i in range(h):
		for j in range(len(link_above[i])):
			if (link_above[i][j] != ' '):
				size = len(output[i - 1])
				if (size < j + 1):
					output[i - 1] += " " *(j + 1 - size)
				jj = j
				if (link_above[i][j] == 'L'):
					while (output[i - 1][jj] == ' '):
						jj += 1
					for k in range(j+1, jj-1):
						str1 = output[i - 1]
						list1 = list(str1)
						list1[k] = '_'
						output[i - 1] = ''.join(list1)
				elif(link_above[i][j] == 'R'):
					while (output[i - 1][jj] == ' '):
						jj-=1
					
					# k = j-1
					for k in range(j-1,jj+1,-1):
						temp = output[i - 1]
						list1 = list(temp)
						list1[k] = '_'
						output[i - 1] = ''.join(list1)
						k = k - 1
      
				str1 = link_above[i]
				list1 = list(str1)
				list1[j] = '|'
				link_above[i] = ''.join(list1)
					
	# Output
	for i in range(h):
		if (i):
			print("\t" , link_above[i])
		print("\t" , output[i])

[1, None, 2, 3, 4, 5, 6, 7, 8]from BinaryTree import *

def lowest_common_ancestor(root, node1, node2):
    current = root

    while current:
        if node1.data > current.data and node2.data > current.data:
            current = current.right
        elif node1.data < current.data and node2.data < current.data:
            current = current.left
        else:
            return current

# Driver code   
def main():
    input_trees = [[TreeNode(6), TreeNode(2), TreeNode(8), TreeNode(0), TreeNode(4), TreeNode(7), TreeNode(9), None, None, TreeNode(3), TreeNode(5)],
        [TreeNode(6), TreeNode(2), TreeNode(8), TreeNode(0), TreeNode(4), TreeNode(7), TreeNode(9), None, None, TreeNode(3), TreeNode(5)],
        [TreeNode(2), TreeNode(1)],
        [TreeNode(5), TreeNode(3), TreeNode(9), TreeNode(1), TreeNode(2), TreeNode(7), TreeNode(10), None, None, None, None, TreeNode(6), TreeNode(8)],
        [TreeNode(100), TreeNode(88), TreeNode(130)]]
    
    input_nodes = [
        [2, 8],
        [2, 4],
        [2, 1],
        [6, 10],
        [88, 130]
    ]

    for i in range(len(input_trees)):
        tree = BinaryTree(input_trees[i])
        print(i+1, ".\tBinary search tree:", sep="")
        display_tree(tree.root)
        print("\n\tnode1 = ", input_nodes[i][0])
        print("\tnode2 = ", input_nodes[i][1])
        lca = lowest_common_ancestor(tree.root, tree.find(input_nodes[i][0]), tree.find(input_nodes[i][1]))
        print("\n\tLowest common ancestor: ", lca.data, sep="")
        print("-"*100)

if __name__ == "__main__":
    main()