(Single choice 20, multiple choice 10, error correction 3, programming 2
Data structure, network, operating system and database
1. Single choice questions (1 out of 4)
<:
1. if n nodes are stored in a binary tree structure, the minimum depth of the binary tree is:
Analysis: a binary tree with a depth of K has at most 2~k-1 nodes. At this time, the binary tree becomes a full binary tree. Log:(N+1)
2. an important operation of shape structure. If the pre sequence of a binary tree is known to be befcgdh and the mid sequence is febcchd, then the post sequence is feghdcb
3. the functions of the following algorithms are:
1 bar is a headless node single chain table*/
LinkList Demo(LinkList L){
ListNode *Q,*P:
If (l&&l I >next){
Q=L;
L=L->next; P=L;
While(p->next)P=p->next; p->next=Q; Q->next=NULL;
}
return L;
Analysis: transform a single linked list into a circular chain header node into a tail node)
收藏
