# Introduction In this challenge, we will implement a bottom-up spiral traversal for the binary tree. In other words, it will start at the lowest non-empty level and alternate between traversing from right to left and from left to right until the root node is visited.
Click the virtual machine below to start practicing