I am writing work on trees in graph theory and a bit confused in concepts. I need to write what kinds of trees exist or the classification of trees. I have found that there exists: oriented / non-oriented tree, spanning, forest, binary, n-dimensional, ordered tree. But it is more and more similar to the properties of trees than to species (except for binary and n-dimensional).

What of this (if I correctly found and missed nothing) will really be a separate type of tree? Also, there is for example a special case of a binary tree - the search tree. Will such a tree be related to graph theory or is it more data structure in programming? The same question with the parse tree. And the last question: does tree walking refer to tree operations as graphs or is the algorithm for the data structure a tree?

    1 answer 1

    Once you write some work on the topic of trees, it is best to present the material as fully as possible.

    Part of what you have listed is general concepts for graphs, and part is concepts for trees.

    If I were you, I would classify according to the following features:

    By directivity - oriented (unidirectional, bidirectional), non-oriented

    By degree of vertex (binary, n-ary, etc.)

    In particular cases - it would also be nice to describe what it was. The binary search tree can be nested in the classification by degrees of a vertex and described by what it stands out. The parse tree is a more specific thing, but if you can describe it, great.

    Since a tree is a graph, classical algorithms for traversing any graph are applicable to it, but in addition there are specific algorithms for trees.

    If you are a student, and this is some kind of work for the university, then the more you write, provided that you understand the essence of what is happening - the better. Writing something without understanding it is not necessary, can get out sideways later.

    • Thank you very much! You answered me all your questions. - JohnS