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
Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Implementing abstract data types A course in data structures and algorithms is hence a course in implementing abstract data types. It may seem that we are paying a lot of atten

WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Q. The system allocates the memory for any of the multidimensional array from a big single dimensional array. Describe two mapping schemes that help us to store the two dimensi

Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55                                                                      Ans:

a. Explain the sum of subset problem. Apply backtracking to solve the following instance of sum of subset problem: w= (3, 4, 5, 6} and d = 13. Briefly define the method using a sta

Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.

The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .