Computers and Technology, 26.12.2021 01:00 brendonvernon8

: ${\huge{\underbrace{\overbrace{\color{aqua}{Question}}}}}$

Write an algorithm to do spiral order traversal of binary tree?

Answers: 1

Show answers

Answers

Answer from: brialevy2283

In level order traversal we make use of a single queue while in spiral order traversal we need use two stacks.

First stack('stackEven') is used to traverse the nodes at even level and second stack('stackOdd') is used to traverse the nodes at odd level.

Nodes at even level are stored in 'stackEven' and are pushed in it from left to right order whereas nodes at odd level are stored in 'stackOdd' and are pushed in it from right to left order.

Algorithm:

1. Push root node into the 'stackEven'. Set boolean 'evenLevel' to true. This boolean variable is used to indicate if the current level being visited is even level or odd level.

2. Now if 'evenLevel' is set to true repeat steps 2a to 2c until 'stackEven' is not empty.

2a. Pop the node from 'stackEven'. Let popped node be 'currentNode'. Print the value of 'currentNode'.

2b. If the right child of 'currentNode' is not null, push it into the 'stackOdd'.

2c. If the left child of 'currentNode' is not null, push it into the 'stackOdd'.

Notice that currentNode's right child is pushed first and then its left child is pushed.

3. If 'evenLevel' is not set to true then repeat steps 3a to 3c until 'stackOdd' is not empty.

3a. Pop the node from 'stackOdd'. Let popped node be 'currentNode'. Print the value of 'currentNode'.

3b. If the left child of 'currentNode' is not null, push it into the 'stackEven'.

3c. If the right child of 'currentNode' is not null, push it into the 'stackEven'.

Notice that currentNode's left child is pushed first and then its right child is pushed.

4. If 'evenLevel' is true set it to false and if it is false set it to true. This is because the next level visited would be odd if current level is even and vice versa.

5. Repeat steps 2-4 until both 'stackEven' and 'stackOdd' are not empty.

Implementation details could be found in function 'spiralTraversal(TreeNode root)' in the code snippet.

Example: Let's look at the state of the stacks as nodes in each level are visited for the following tree.

(attachment) 1.(see attachment 2)(attachment 3)

The time complexity of this algorithm is O(n) and extra space used is also O(n).

:

Write an algorithm to do spiral order traversal of binary tree?

Answer from: Quest

Hdi4nfnfuhdjdurjfjc7fjrnckf snuck fhfjfkfmfjfk4jrhr

Answer from: Quest

There would be an arrow and page design

Another question on Computers and Technology

Computers and Technology, 22.06.2019 02:00

Aisha has finished working on a word processing document that contains 15 pages. she has added some special elements in the first three pages, page 9 and 10, and page 15 from the document. she wants to print only these pages to see how they look. which option is the correct way to represent (in the print dialog box) the pages that aisha wants to print?

Answers: 1

Answer

Computers and Technology, 23.06.2019 06:00

What machine listens for http requests to come in to a website’s domain? a. a router b. a browser c. a server d. a uniform resource locator

Answers: 1

Answer

Computers and Technology, 23.06.2019 13:30

Stops: using the information learned in this course, explain three things you will not do when driving. a. b. c. explain why you will not do these things when driving. starts: using the information learned in this course, explain three things you will do when driving. a. b. c. explain why you will do these particular things when driving. explain one thing you will stop doing as a passenger. explain one thing you will start doing as a passenger.

Answers: 3

Answer

Computers and Technology, 24.06.2019 03:30

Explain the importance of html in web page designing in 20 sentences..

Answers: 1

Answer

You know the right answer?

:

Write an algorithm to do spiral order traversal of binary tree?...

Questions