Spiral order traversal of BST

• Use two stacks to traverse the tree in a spiral order

• Push the root node into the first stack

• While the first stack is not empty, pop a node and print its value

• Push its left...read more

initialise right=no. of columns -1, bottom=no. of rows -1, and top and left as zero.

• define answer array to store the results vector<int>ans;

• loop until all array is traversed while(top<=bottom && left<...read more