1544 Words7 Pages

Tree definitions
If you already know what a binary tree is, but not a general tree, then pay close attention, because binary trees are not just the special case of general trees with degree two. I use the definition of a tree from the textbook, but bear in mind that other definitions are possible.
Definition. A tree consists of a (possible empty) set of nodes. If it is not empty, it consists of a distinguished node r called the root and zero or more non-empty subtrees T1, T2, …, Tk such that there is a directed edge from r to each of the roots of T1, T2, …, Tk.Definition. A forest is a collection of trees. You can always create a tree form a forest by creating a new root node and making it the parent of the roots of all of the trees in the forest. Conversely, if you lop off the root of a tree, what is left is a forest.
I assume that you are familiar with the terminology of binary trees, e.g., parents, children, siblings, ancestors, descendants, grandparents, leaf nodes, internal nodes, external nodes, and so on, so I will not repeat their definitions here. Because the definitions of height and depth may vary from one book to another, I do include their definitions here, using the ones from the textbook.
Definition. A path from node n1 to node nk is a sequence of nodes n1, n2, …, nk such that ni is the parent of ni+1 for 1 ≤ i < k. The length of a path is the number of edges in the path, not the number of nodes. Because the edges in a tree are directed, all paths are “downward”, i.e., towards leaves and away from the root. The height of a node is the length of the longest path from the node to any of its descendants. Naturally the longest path must be to a leaf node. The depth of a node is the length of the path from the root to the node. The root has depth 0. All leaf nodes have height 0.
The height of a tree is the height of its root. The degree of a node is the number of children of the node. The degree of a tree is the maximum degree of the degrees of its nodes. The tree on the next page has height 3 and degree 5.

Related

## Graph Theory Essay

1962 Words | 8 PagesIn order to define and establish what graph theory is, we must first make note of its origin and its basis within the broad subject of mathematics. Graph theory, a smaller branch in a large class of mathematics known as combinatorics, which defined by Jacob Fox as, “is the study of finite or countable discrete structures.” Areas of study in combinatorics include enumerative combinatorics, combinatorial design, extremal combinatorics, and algebraic combinatorics. These subfields consist of the counting

## Graph Theory: The Four Coloring Theorem

1566 Words | 7 PagesGraph Theory: The Four Coloring Theorem "Every planar map is four colorable," seems like a pretty basic and easily provable statement. However, this simple concept took over one hundred years and involved more than a dozen mathematicians to finally prove it. Throughout the century that many men pondered this idea, many other problems, solutions, and mathematical concepts were created. I find the Four Coloring Theorem to be very interesting because of it's apparent simplicity paired with it's

## Graph Theory Concepts and Strategies with Ticket to Ride

2979 Words | 12 PagesStates and southern Canada to earn points as well as completing routes designated on the destination tickets. The game itself is not only a fun way to spend hours playing but it is also a good tool to showcase various concepts in graph theory and combinatorics. Graph theory may also be useful in creating or enhancing game play strategies. Set Up and Game Play The original version of the game has a map of the United States and southern Canada with 30 destination tickets. An expansion to the original

## The Seven Bridges of Königsberg

746 Words | 3 PagesThis was the beginning of the Königsberg Bridge Problem, which would soon attract the attention of many, including a man by the name of Leonard Euler. Not only would the solution to this problem set the grounds for what would become known as the graph theory, but it would also be forever remembered in the world of mathematics (Green, Paoletti, and Diestel 19). The bridges of Königsberg posed a problem not many, if any, had ever considered before. At first, their question was, could all seven bridges

## Ramsey Theory Essay

549 Words | 3 Pagesrelatively recent, burgeoning topic-within-a-topic of Ramsey Theory, giving an entry level mathematical introduction to the subject. Ramsey Theory is a branch of combinatorics, which is the eld of math involving the study of nite, discrete objects. In a general sense, Ramsey Theory is concerned with the preservation of certain properties of graphs under various circumstances. In more specic terms, Ramsey Theory asks how many vertices a graph must have to contain a complete s-subgraph or for the graph's

## Essay On Chromatic Polynomial

1029 Words | 5 PagesThe chromatic polynomial is a concept in algebraic graph theory that was first studied by George David Birkhoff in 1912. As a function of the number of colours, it evaluates all possible distinct vertex colourings of a given graph. Using the edge deletion and contraction method, the chromatic polynomial can be expressed as a sum of simpler subgraphs. Hence, it can be evaluated recursively. Many relevant properties can also be proven inductively. George originally studied the chromatic polynomial

## Theories Of Outsourcing

950 Words | 4 PagesWithin Organization Economics and Management Theory, two largely separate streams of outsourcing literature dominate the discussion and have been applied extensively: the governance perspective (New Institutional Economics, especially Transaction Cost Economics) and the competence perspective (Resource- and Knowledge-Based View) of the firm (Foss 1993). We argue that neither theory has sufficient explanatory power with respect to outsourcing failure. Within the New Institutional Economics, Transaction

## Studying a Simple Harmonic Oscillator

1252 Words | 6 PagesStudying a Simple Harmonic Oscillator Objective --------- The simple harmonic motion of a pendulum can be studied by attaching a ticker-tape to a pendulum bob and analyzing the dots marked on the tape. Theory ------ In this experiment, a string was used to suspend a 0.5 kg mass. [IMAGE] Refer to the diagram above, [IMAGE] Considering the tangential force on the mass, [IMAGE] [IMAGE] âˆ´The oscillation is simple harmonic

## Projectile Motion Laboratory

696 Words | 3 Pagesto figure out what angle and what velocity made the object go farther or make it stay in the air longer. I also found mass will affect the height and distance. I used the site Galileo and Einstein to figure out these factors. (Fowler, M) Theory: The theory behind projectile motion is anything thrown or shot moves at a constant speed and is affected by a constant acceleration of -9.8 m/s2. (Projectile Motion) The equation x = vot shows the distance the object will travel (Physics: Principles and

## Modeling a Sample of Radioactive Decay on Material Using Dice

1158 Words | 5 PagesMethod: To use 600 dice and roll them up to the decided throw number of 14. This is going to be used as an example to show how the decaying of radioactive material works. Results: A results table for the number of dice remaining graph: Throw number Number of dice remaining Average 1 84 83 90 90 79 82 84.6 2 72 75 71 75 66 74 72.2 3 61 62 59 66

### Graph Theory Essay

1962 Words | 8 Pages### Graph Theory: The Four Coloring Theorem

1566 Words | 7 Pages### Graph Theory Concepts and Strategies with Ticket to Ride

2979 Words | 12 Pages### The Seven Bridges of Königsberg

746 Words | 3 Pages### Ramsey Theory Essay

549 Words | 3 Pages### Essay On Chromatic Polynomial

1029 Words | 5 Pages### Theories Of Outsourcing

950 Words | 4 Pages### Studying a Simple Harmonic Oscillator

1252 Words | 6 Pages### Projectile Motion Laboratory

696 Words | 3 Pages### Modeling a Sample of Radioactive Decay on Material Using Dice

1158 Words | 5 Pages