Tree codes find wide use in a variety of problems such as source encoding, sequential decoding, pattern recognition, and related fields. Efficient algorithms exist to explore the code trees and are well documented in the literature. All of these algorithms search code trees in an incremental manner, releasing a path map symbol at a time. A recent work has investigated the effect of releasing multiple symbols on the performance of the(M, L)algorithm used with speech. Here we investigate the effect of multiple symbol release rules on the performance of the stack algorithm in the context of speech encoding. We show that significant computational reduction can result with the use of such rules. We use an efficient data structure, the AVL tree data structure, to store code tree paths.