求广义表的深度

利用数组传值，建立单链表并将其初始化。

利用递归求出每个子表的深度，进而求出广义表的深度。

先看两个表的深度是否相同，若相同，对表A中的每个元素i，扫描表B中的每个元素，对与i深度相同的元素j,再将i中的每个元素与j中的每个元素进行比较。（运用递归算法）-Seeking a broad depth of the table

The use of an array passed by value, establish a single list of its initialization.

Recursive find the depth of each sub-table, and then find the generalized table depth.

Depth look at two tables are the same, if the same as in Table A, each element i, scan the table B, each element with the i elements of the same depth of j, then i each element j in each element were compared. (Using a recursive algorithm)

搜索