Description: 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.
To Search:
File list (Check if you may need any files):
data_struct6.txt
Download