four_six的博客

ggjj求赐教-- 懒惰删除中如果树中的实际节点数和“被删除”的节点数相同，那么树的深度预计只上升一个小的常数。。这个怎么理解？

#include<unistd.h> #include<signal.h> #include<stdio.h> #include<stdlib.h> #include<sys/wait.h> int pid1,pid2; int main() { int fd[2]; char OutPipe[100],InPipe[100]; pipe(fd); while((pid1=fork())==-1); if(pid1==0) { lockf(fd[1],1,0); sprintf(OutPipe,"child 1 process is sending message!"); write(fd[1],OutPipe,50); sleep(3); lockf(fd[1],0,0); exit(0); } else { while((pid2=fork())==-1); if(pid2==0) { lockf(fd[1],1,0); sprintf(OutPipe,"child 2 process sending message!"); write(fd[1],OutPipe,50); sleep(3); lockf(fd[1],0,0); exit(0); } else { wait(0); read(fd[0],InPipe,50); printf("%s\n",InPipe); wait(0); read(fd[0],InPipe,50); printf("%s\n",InPipe); exit(0); } } }