Welcome! Log In Create A New Profile

Advanced

Exam 2005 - Question 8 ?

Posted by esckay 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Forums Messages New
esckay
Exam 2005 - Question 8 ?
October 07, 2006 09:29AM
Hi,

Hope someone can help me, I am a bit stuck with this one. Question 8 c .... level-order ?

I dont know if I worked a bit crap through the text book or if I missed some info, but I cant recall level-order traversal, I know the inorder, preorder and postorder binary tree traversals ... but level-order?

Can someone please shed some light on this?

Thanks,
Esckay
Reply Quote
esckay
Re: Exam 2005 - Question 8 ?
October 07, 2006 09:40AM
Sorry, I forgot about Question 8 e. I am struggling with this one as well. Any help will be appreciated.

Thanks,
Esckay
Reply Quote
stevenv
Re: Exam 2005 - Question 8 ?
October 07, 2006 11:20AM
I think that by level-order sequence they may be referring to in-order traversal which is one of the three traversal methods available. The other two are pre- and post-order. Haven't seen anything in the textbook about level-order.
Reply Quote
esckay
Re: Exam 2005 - Question 8 ?
October 07, 2006 06:59PM
Isnt level-order traversal similiar to breadth traversal ?
Reply Quote
34435360
Re: Exam 2005 - Question 8 ?
October 08, 2006 01:05PM
VERY cool site, it shows you the binary tree traversals, apparently level-order traversal = breath traversal.

http://nova.umuc.edu/~jarc/idsv/lesson1.html

Also, this one lets you design your own tree and then traverse it
http://webpages.ull.es/users/jriera/Docencia/AVL/AVL%20tree%20applet.htm

The orders come out as:
inorder
25,30,40,50,80,98

preorder
50,30,25,40,80,98

postorder
25,40,30,98,80,50
Reply Quote
Trishen
Re: Exam 2005 - Question 8 ?
October 08, 2006 01:44PM
level order is when the nodes are traversed level by level. The level order of the tree given will be 50, 30 , 80, 25, 40, 96.
Reply Quote
esckay
Re: Exam 2005 - Question 8 ?
October 08, 2006 06:59PM
Though so, I read something similiar on a site ... but I dont think is fair is they ask questions not covered in the sylibus.
Reply Quote
stevenv
Re: Exam 2005 - Question 8 ?
October 08, 2006 08:53PM
In the section on binary tree traversals they refer only to three methods: inorder, postorder and preorder. In my opinion last year's exam was referring to inorder traversal.
Reply Quote
esckay
Re: Exam 2005 - Question 8 ?
October 09, 2006 08:39AM
I had a bit more of a search on the net, and from what I found level-order=breadth traversal.

I know if wasnt covered in the text book, but my bet will be to do level order traversal. Priint the tree level by level starting at the root and from left to right. A queue is used to implement this traversal algorithm.
Reply Quote
Newer Topic Older Topic
Sorry, only registered users may post in this forum.

Click here to login