Use a queue to traverse the tree, dequeueing a node when it is visited, and enqueueing its
children. The pseudo code is given below:
traverseLevelOrder (Tree t) {
Queue q = new Queue()
q.enqueue(t)
while !q.isEmpty() {
Node current=q.dequeue()
if (current<>NULL) {
q.enqueue(current.left)
q.enqueue(current.right)
}
}
}
children. The pseudo code is given below:
traverseLevelOrder (Tree t) {
Queue q = new Queue()
q.enqueue(t)
while !q.isEmpty() {
Node current=q.dequeue()
if (current<>NULL) {
q.enqueue(current.left)
q.enqueue(current.right)
}
}
}
Comments
Post a Comment
https://gengwg.blogspot.com/