C Tree_Down mit moeglichst wenigen parallelen Send-Operationen
C       ueber die hoechsten Link-Nummern (evtl. gut fuer GC !)
C
      SUBROUTINE TREE_DOWN (N,WORDS)
      INTEGER    WORDS(N)
      LOGICAL    BTEST
        INCLUDE 'include/trnet.inc'
      K=1
      IF (ICH .EQ. 0) THEN
	L=NCUBE
      ELSE
	L=0
        DO WHILE (.NOT. BTEST(ICH,L))
	  L=L+1
	ENDDO
	CALL Recv_Chan(N,WORDS,L+1)
      ENDIF
      IF (L .GT. 0) THEN
        DO 3 K=L,1,-1
          CALL Send_Chan(N,WORDS,K)
3       CONTINUE
      ENDIF
      RETURN
      END