Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

Register Log in
  • Congratulations strongm on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

Breadth-First Traversal of Binary Tree

Status
Not open for further replies.
MotherCow

MotherCow

Programmer
Dec 4, 2009
1
US
How do I write Prolog code that allows me to traverse a binary tree breadth-first? What do I query to show that the code works? How do I set up a tree? Thanks for your help in advance.
 
Status
Not open for further replies.

Similar threads

S.K
  • Locked
  • Question
Compress a list that contains segments of continuous numbers to a list which contains list of range
Replies
0
Views
214
S.K
S.K
prologuser8
  • Locked
  • Question
Sorting a list of tupples - Maze exercise
Replies
0
Views
116
prologuser8
prologuser8
VinnieCFC
  • Locked
  • Question
Prolog DFS method implementation for a tree
Replies
0
Views
196
VinnieCFC
VinnieCFC
4766667
  • Locked
  • Question
Binary Permutations
Replies
3
Views
77
nn987
nn987
rukman
  • Locked
  • Question
Write Prolog code which will perform a postorder traversal
Replies
0
Views
38
rukman
rukman

Part and Inventory Search

Sponsor

Back
Top