In this paper, we present three kinds of broadcasting tree for the even dimensional uni-directional hypercube (UHC) and its applications (ASCEND/DESCEND algorithms and bitonic sorting). For the n-dimensional UHC, under the constant evaluation model, one of our all-port broadcasting trees has height n + 1, which is optimal. Whereas the best one of our one-port broadcasting trees needs at most steps steps exactly). We also propose an all-port fault-tolerant broadcasting tree (a family of arc-disjoint spanning trees) whose height is no more than At last, we show that the SCEND/DESCEND algorithms and bitonic sorting can be implemented in the UHC with the same complexity as the hypercube under the half duplex mode. All of our algorithms can be easily applied to the odd dimensional UHC.