Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution P͑k͒ϳk −␥ , where the degree exponent ␥ describes the extent of heterogeneity. In this paper, we study analytically the average path length ͑APL͒ of and random walks ͑RWs͒ on a family of deterministic networks, recursive scale-free trees ͑RSFTs͒, with negative degree correlations and various ␥ ͑2,1+ln 3/ ln 2͔, with an aim to explore the impacts of structure heterogeneity on the APL and RWs. We show that the degree exponent ␥ has no effect on the APL d of RSFTs: In the full range of ␥, d behaves as a logarithmic scaling with the number of network nodes N ͑i.e., d ϳ ln N͒, which is in sharp contrast to the well-known double logarithmic scaling ͑d ϳ ln ln N͒ previously obtained for uncorrelated scale-free networks with 2 Յ ␥ Ͻ 3. In addition, we present that some scaling efficiency exponents of random walks are reliant on the degree exponent ␥.