文件名称:data_struct6
介绍说明－－下载内容均来自于网络，请自行研究使用
数据结构课后设计题第六章
6.33③ 假定用两个一维数组L[1..n]和R[1..n]作为
有n个结点的二叉树的存储结构， L[i]和R[i]分别指
示结点i的左孩子和右孩子，0表示空。试写一个算法
判别结点u是否为结点v的子孙。-Data structure design question after class VI 6.33 ③ assumed with two one-dimensional array L [1 .. n] and R [1 .. n] as an n-node binary tree storage structure, L [i ] and R [i] i were instructions left child node and right child, 0 means empty. Try to write an algorithm to determine whether node u is node v' s descendants.
6.33③ 假定用两个一维数组L[1..n]和R[1..n]作为
有n个结点的二叉树的存储结构， L[i]和R[i]分别指
示结点i的左孩子和右孩子，0表示空。试写一个算法
判别结点u是否为结点v的子孙。-Data structure design question after class VI 6.33 ③ assumed with two one-dimensional array L [1 .. n] and R [1 .. n] as an n-node binary tree storage structure, L [i ] and R [i] i were instructions left child node and right child, 0 means empty. Try to write an algorithm to determine whether node u is node v' s descendants.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
data_struct6.txt