Implementation of ADT Tree (array) to perform the following operations on an ordered general tree
a. create a tree (which is initially empty) ... max of 2 levels only
b. leftmost child (n, T) - returns the leftmost node in the tree T
c. right_sibling(n,T) - returns the right sibling of a node.
d. parent (n,T) - returns the parent of node n in the tree T.
e. root(T) - returns the root node of a tree
Wing_1
0
Newbie Poster
rubberman
1,355
Nearly a Posting Virtuoso
Featured Poster
Sorry, but we don't do your homework for you. Read the terms of service for this site for more information. YOU write the code, test it, post it here for help when you get errors or incorrect behavior that you cannot solve, along with the errors and incorrect behavior that you are getting.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.