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
Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac

basic calculation for algorith.

Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed

Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR

how to write an algorithm for unions & intersection of two linklists?

Q. Make a BST for the given sequence of numbers. 45,32,90,34,68,72,15,24,30,66,11,50,10 Traverse the BST formed in  Pre- order, Inorder and Postorder.

How do I submit a three page assignment