在深度为5的完全二叉树中,度为2的结点数最多为 【1】 。
参考答案:O
用所给词的适当形式填空。(每空一词)
小题1:Yesterday afternoon my uncle had his bicycle _________(repair).
小题1:
小题2:She can’t be a nurse because she is _____________(patient).
小题2:
小题3:Stop__________(argue) about it. Let’s be friends again.
小题3:
小题4:I think the new computer is (value).
小题4:
小题5:A __________ (week) round-up of sports will come after this music programme.
小题5:
在先左后右的原则下,根据访问根结点的次序,二叉树的遍历可以分为三种:前序遍历、 遍历和后序遍历。