i need to create an avl tree that uses a pre determined ajencency matrix stored in a dual dimentional array. the program must include the following

insert function

search function

create function

thankX

Pacco

insert function

search function

create function

thankX

Pacco

I presume that the question pre-supposes that the matrix represents such a tree (or better a graph which looks like such a tree), the create function takes the matrix and produces a tree, the insert and delete functions operate on the tree. But before one starts writing code I need a couple of questions answered :-

1) Does adjacency matrix also contain the leaf nodes?

2) Are we given the root node as a parameter with the matrix?

At this site there is some c++ code for inserting a node.

Please provide your email to receive a free trial preview!

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.