Implementation of tree, Data Structure & Algorithms

Assignment Help:

The most common way to insert nodes to a general tree is to first discover the desired parent of the node you desire to insert, and then insert the node to the parent's child list. The most common implementations add the nodes one at a time, however since each node can be considered a tree on its own, other implementations build up a whole sub-tree before adding it to a larger tree. As the nodes are inserted & deleted dynamically from a tree, tree is frequently implemented by link lists. Though, it is simpler to write algorithms for data representation where the numbers of nodes are fixed. Figure illustrated the structure of the node of a general k-ary tree.

921_IMPLEMENTATION OF TREE.png

Figure: Node structure of a general k-ary tree

2271_IMPLEMENTATION OF TREE1.png

 Figure: A linked list representation of tree (3-ary tree)

Figure illustrates a tree with one data element & three pointers. The number of pointers needed to implement a general tree depends of the maximum degree of nodes into the tree.


Related Discussions:- Implementation of tree

Stack, Explain the array and linked list implementation of stack

Explain the array and linked list implementation of stack

Linked list, How to creat ATM project by using double linked list?

How to creat ATM project by using double linked list?

Algorithm, Ask question #MWhich of the following is not a characteristic of...

Ask question #MWhich of the following is not a characteristic of good algorithm? inimum 100 words accepted#

Present the algorithm of binary search. , B i n a ry Search Alg...

B i n a ry Search Algorithm is given as follows 1. if (low > high) 2.     return (-1) 3. mid = (low +high)/2; 4. if ( X = = a [mid]) 5.      return (mid); 6.

Multiple queue, What is multiple queue and explain them

What is multiple queue and explain them

Explain avl tree, AVL tree An AVL tree is a binary search tree in which...

AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again

Exlain double linked list, Double Linked List In a doubly linked list, ...

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

Singly linked list , The two pointers per number of a doubly linked list pr...

The two pointers per number of a doubly linked list prepare programming quite easy. Singly linked lists as like the lean sisters of doubly linked lists. We need SItem to consider t

B – trees, B-trees are special m-ary balanced trees utilized in databases s...

B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-

Explain cam software, Explain CAM software CAD/CAM software has been re...

Explain CAM software CAD/CAM software has been recognized as an essential tool in the designing and manufacturing of a product due to its ability to depict the designs and tool

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd