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

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

explanation:

Answer from: Quest

He would most likely be employed by a gov. agency or homeowner because he has the required skills that have to be known to apply and get hired into those jobs.

Another question on Computers and Technology

Computers and Technology, 22.06.2019 20:00

What side length would you specify if you were required to create a regular hexagonal plate that was composed of 33 cm(squared) of sheet metal? dimension the side length to 0.1 cm

Answers: 2

Answer

Computers and Technology, 23.06.2019 01:30

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.

Answers: 3

Answer

Computers and Technology, 23.06.2019 20:00

Me ajude por favor , coloquei uma senha e não consigo tira-la no chorme

Answers: 2

Answer

Computers and Technology, 24.06.2019 06:50

What are the things you are considering before uploading photos on social media?

Answers: 1

Answer

You know the right answer?

:

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