binary expression tree

基本解釋

The concepts such as mathematical expression, stack operation and binary tree traversal must be presented in data structure.
數(shù)學(xué)表達(dá)式、棧的操作、二又樹的遍歷，這幾個(gè)概念在數(shù)據(jù)結(jié)構(gòu)的教材中是不可缺少的。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
終結(jié)符號(hào)處理過程中，深入地研究了字符串匹配算法和正則表達(dá)式匹配算法，并實(shí)現(xiàn)了二叉排序樹字符串匹配算法。