Scholars Central

Research articlePublished 2014

On generation algorithm of prefix code-based postorder traversal tree and its application

Authors: Meixia Tang, Yu Liu

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The paper strives to solve nodes structural relationship, and can effective produce traverse tree’s subtree and so on, therefore the paper proposes a kind of unified nodes and data structure prefix coding heel traverse tree generative algorithm, the algorithm is helpful for fuzzy searching and systematic analysis seeking, in addition, the algorithm doesn’t need any special requirements in running period, each node branch can be different, so the algorithm is a kind of general algorithm, it can construct subtree in case don’t increase complicated extents, by experiment, it can get the algorithm is obviously superior to traditional algorithm, so verify it by concrete experiments, and get the algorithm is convenient and effective.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in BioTechnology: An Indian Journal.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalBioTechnology: An Indian Journal
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Meixia Tang”
  • BylineArticles whose byline prints “Yu Liu”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels