Purchase Solution

Graph Theory -Tree and Tree Structures

Not what you're looking for?

Ask Custom Question

Trees can be used for many applications in computer science. One of these applications is decision-making, which is often used in the creation and analysis of databases.
a) In one paragraph, define what trees are. Be sure to mention the difference between binary and n-ary trees.

b) Represent the following hierarchical database information using a tree structure.
Each university department has one chairperson. The chairperson has a secretary and a vice-chairperson who both report to the chairperson. The secretary has an assistant called the secretarial assistant. The vice chairperson has an administrative assistant. The administrative assistant oversees the professors in the department and the professor oversees the students.

c) There are several methods that can be used to traverse and search a tree. Review the two methods from the list below and in two to three paragraphs, explain how each method works, how they are similar, and how they are different.

1) Depth-First Search
2) Breadth First Search

Purchase this Solution
Solution Summary

This solution is comprised of a detailed discussion and explanation of the various aspects of Tree and Tree Structures in Graph Theory.

Solution Preview

a)Tree: In Graph Theory, a tree is a way of representing the order of a structure in graphical form. This graph is called a "tree structure" because the representation resembles a tree in an inverted form. Every finite tree structure has a superior member, which is called the "root" or root node. It acts as the starting node for the structure. The elements ...

Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Simple Circuitts

    According to a formula in graph theory, we know that if T is a tree, then the number of edges in T is n-1, where n is the number of vertices in T.

  • Graph Theory and Parse Tree

    590945 Graph Theory and Parse Tree 1. Path Analysis Here is a Question for you: For the diagram below find all the "simple paths" from A to F.

  • Tree in Polyhedron Figures

    In graph theory, a tree is a graph in which any two vertices are connected by exactly one path. tree is an undirected simple graph G that satisfies any of the following equivalent conditions: • G is connected and has no simple cycles • G has no simple

  • Vertices of a tree

    83675 Vertices in Tree A tree has 11 vertices of degree 3, 12 vertices of degree 2, 10 vertices of degree 4 and the remaining vertices are of degree 1. How many vertices does it have? Assume that there are n vertices in the tree.

  • JAVA- Data Structures and Algorithms

    #1 compares 3 times, tree #2 compares 5 times, tree #3 compares 5 times and tree #4 compares one time.

  • Trees and Graphs: Does the Graph Exist?

    But then number of vertices can't be 5 because a tree with 5 vertices has 4 edges, so again the specified graph does not exist The existence of a graph in tree and graph scenarios is investigated.

  • Graph

    Tree, degrees: 0, 0, 1, 1, 2, 3, 3. From our definition of a tree we require the graph to be connected. Here there are nodes with degree 0, so the graph cannot be connected and hence cannot be a tree. c.

  • Spanning Trees and Graphs

    To have a spanning tree, the graph must be connected, i.e. given any two nodes A and B, there exists a path that connects A and B. Every connected graph has a spanning tree.

  • Finding Maximum Values by Graphing

    This solution then provides a graph and gives the maximum production value of oranges.

View More Related Solutions