Define tree ?, Data Structure & Algorithms

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

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
Related Questions
How sparse matrix stored in the memory of a computer?

Algorithm for deletion of any element from the circular queue: Step-1: If queue is empty then say "queue is empty" & quit; else continue Step-2: Delete the "front" element

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Definition: A set of data values & related operations that are accurately specified independent of any particular implementation. As the data values and operations are described

Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

This unit dealt along with the methods of physically storing data in the files. The terms fields, records & files were described. The organization types were introduced. The sev

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

Q. Explain the various memory allocation strategies.                                                            Ans. M e m ory Allocation Strategies are given as follow

A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Thoug