Description: Seeking a binary tree of two recent common ancestor node input: with a null pointer under preorder traversal results establish ordinary binary data element types: character type null pointer:# Input format: The first line: the order of the number of elements N Second row: the third line of the sequence of elements: Character x Character y output format: x and y of the most recent common ancestor of the element value, or NULL. Note: 1, input error, the output ERROR (uppercase) and end the program. 2, the elements of the tree node holds the value character type. 3, any excess output as an error. 4, the binary tree node keyword is the primary key
To Search:
File list (Check if you may need any files):
寻找最近公共祖先.c
Download