A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree of the root.

Tree nodes have much useful functionality. The depth of a node is the length of the path from the root to that edge. The height of a node is the longest way from that node to its leaves. The length of a tree is the height of the parent node. A parent node has no children -- its only path is up to its parent. Describe the axiomatic development of trees and its rules for more information.

 

Posted Date: 7/27/2012 6:26:16 AM | Location : United States

Ask an Expert

Related Discussions:- Define tree ?, Assignment Help, Ask Question on Define tree ?, Get Answer, Expert's Help, Define tree ? Discussions

Write discussion on Define tree ?
Your posts are moderated

Write your message here..

Related Questions

Efficient algorithms.., implementation of fast fourier transforms for non p... implementation of fast fourier transforms for non power of 2

Multiqueue, data structure for multiqueue data structure for multiqueue

Explain how the shuttle sort algorithm works, Question 1 Explain how th... Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

Convertion, how we can convert a graph into tree how we can convert a graph into tree

Draws a rectangular grid algorithms, Prepare a GUI called Hotplate GUI that... Prepare a GUI called Hotplate GUI that holds a central panel that draws a rectangular grid that represents Element objects which should be held in a 2-dimensional array. The applic

Financial index data analysis, need c++ algorithmic software program to der... need c++ algorithmic software program to derive one numerical outcome from 10 levels of variables with 135 combinations cross computed

Insertion of a node into a binary search tree, A binary search tree is cons... A binary search tree is constructed through the repeated insertion of new nodes in a binary tree structure. Insertion has to maintain the order of the tree. The value to the lef

Properties of asyptotic notations, what are the properties of asyptotic not... what are the properties of asyptotic notations

frequenty count of function, Ask question find frequency count of function... Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Program to manipulate the data structure, Data Structure and Methods: ... Data Structure and Methods: Build an array structure to accomodate at least 10 elements. Provide routines for the following: An initializer. A routine to populate (