• 2022-06-07
    给出一棵树的逻辑结构T=(N,R),其中:‎N={A,B,C,D,E,F,G,H,I,J,K}‎R={r}‎r={(A,B),(B,E),(B,F),(F,G),(F,H),(A,C),(C,I),(C,J),(J,K),(A,D)} ‎试回答下列问题:‎Given a logical structure of a tree, T=(N, R), and N={A, B, C, D, E, F, G, H, I, J,K}, R={r}, r={(A,B), (B,E), (B,F), (F,G), (F,H), (A,C), (C,I), (C,J), (J,K), (A,D)} Please answer these questions: ‎(1)哪些是叶结点?which are the leaf nodes? ‎(2)哪些是F的祖先?which is the parent node of Node F? ‎(3)树的深度是多少?what is the depth of the tree?‎(注:根的层数为0,独根树深度为0,高度为1,其他题目同样如此;同一个小题的答案如果有多个字母,按照字典序排列,且不要以空格分隔,不同小题用一个空格隔开)‎