Noncontiguous Pattern Containment in Binary Trees

<table>Binary trees with at most <svg height="10.8625" id="M27" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 8.2875004 10.8625" width="8.2875004" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.8)"><path d="M456 178h-96v-72q0 -51 12.5 -62.5t72.5 -16.5v-27h-256v27q65 5 78 17t13 62v72h-260v28q182 271 300 426h40v-407h96v-47zM280 225v295h-2q-107 -148 -196 -295h198z" id="x34"></path></g>
</svg> leaves.</table>

International Scholarly Research Notices

fig1

Figure 1

Figure 1: Noncontiguous Pattern Containment in Binary Trees 