Algorithm binary tree makes a path by level of T with complexity O (n)

Question

Hey guys I have a doubt to resolve this issue, someone could help me?

A level path in a binary T tree visits all T nodes per level (first level 0 followed by levels 1, 2, 3...) where nodes of the same level are visited from left to right.

Write an algorithm that receives as input a binary tree T and makes a path by level of T with complexity O (n), where n is the number of nodes of T.

Using pseudocode:)

Answer 1

Hey guys I have a doubt to resolve this issue, someone could help me?

A level path in a binary T tree visits all T nodes per level (first level 0 followed by levels 1, 2, 3...) where nodes of the same level are visited from left to right.

Write an algorithm that receives as input a binary tree T and makes a path by level of T with complexity O (n), where n is the number of nodes of T.

Using pseudocode:)