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
an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record. The choice of s

How will you represent a max-heap sequentially? Max heap, also known as the descending heap, of size n is an almost complete binary tree of n nodes such that the content of eve

Illustrates the program for Binary Search. Program: Binary Search /*Header Files*/ #include #include /*Functions*/ void binary_search(int array[ ], int value,

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

perform the following length operation LENGTH("welcome to ICA")=

Q. Which are the two standard ways of traversing a graph?  Explain them with an example of each.  Ans:   T he two ways of traversing a graph are written below

The number of leaf nodes in a complete binary tree of depth d is    2 d

example of stack using flowchart

Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea