文件名称:data_struct6
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:3.23kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
数据结构课后设计题第六章
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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.