Abstract: We apply the Euler tour technique to find subtrees of specified weight as follows. Let k,g,N1​,N2​∈N such that 1≤k≤N2​, g+h>2 and 2k−4g−h+3≤N2​≤2k+g+h−2, where h:=2N1​−N2​. Let T be a tree of N1​ vertices and let c:V(T)→N be vertex weights such that c(T):=∑v∈V(T)​c(v)=N2​ and c(v)≤k for all v∈V(T). We prove that a subtree S of T of weight k−g+1≤c(S)≤k exists and can be found in linear time. We apply it to show, among others, the following: (i) Every planar hamiltonian graph G=(V(G),E(G)) with minimum degree δ≥4 has a cycle of length k for every k∈{⌊2∣V(G)∣​⌋,…,⌈2∣V(G)∣​⌉+3} with 3≤k≤∣V(G)∣. (ii) Every $3$-connected planar hamiltonian graph G with δ≥4 and ∣V(G)∣≥8 even has a cycle of length 2∣V(G)∣​−1 or 2∣V(G)∣​−2. Each of these cycles can be found in linear time if a Hamilton cycle of the graph is given. This work was partially motivated by conjectures of Bondy and Malkevitch on cycle spectra of 4-connected planar graphs.