Ask: How to find the rightmost node of the last layer of a complete binary tree

icevan

Yes, breadth traversal

aresyt

I think about it this way:
Queue-based breadth-first traversal is used. Each time a visited node is popped from the queue into the stack, the data item at the top of the stack after the traversal is requested.
The complexity of this algorithm is indeed much greater than that of array-based ones.

voices

Is it OK to go down by layers?

ddd223

Hierarchical traversal and breadth-first methods are the same.

mars1004

It is also possible to traverse first or in the middle.