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
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in In-order

The time needed to delete a node x from a doubly linked list having n nodes is O (1)


Have you ever thought about the handling of our files in operating system? Why do we contain a hierarchical file system? How do files saved & deleted under hierarchical directories

Post-order Traversal This can be done both iteratively and recursively. The iterative solution would need a change of the in-order traversal algorithm.

Merging 4 sorted files having 50, 10, 25 and 15 records will take time  O (100)

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

How To implement stack using two queues , analyze the running time of the stack operations ?

give some examples of least cost branch and bound method..

What are circular queues?  Circular queue: Static queues have a very large drawback that once the queue is FULL, even though we erase few elements from the "front" and relieve