Clockwise Spiral Traversal of Binary Tree | Set - 2
Last Updated :
11 Aug, 2021
Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree.
Examples:
Input :
1
/ \
2 3
/ \ \
4 5 6
/ / \
7 8 9
Output :1 9 8 7 2 3 6 5 4
Input :
20
/ \
8 22
/ \ / \
5 3 4 25
/ \
10 14
Output :20 14 10 8 22 25 4 3 5
We have already discussed Clockwise spiral traversal of binary tree using a 2D array. Here we will discuss another approach which will not use 2D array.
Approach: The idea is to use two variables i initialized to 1 and j initialized to the height of tree and run a while loop which wont break until i becomes greater than j. We will use another variable flag and initialize it to 0. Now in the while loop we will check a condition that if flag is equal to 0 we will traverse the tree from left to right and mark flag as 1 so that next time we traverse the tree from right to left and then increment the value of i so that next time we visit the level just below the current level. Also when we will traverse the level from bottom we will mark flag as 0 so that next time we traverse the tree from right to left and then decrement the value of j so that next time we visit the level just above the current level. Repeat the whole process until the binary tree is completely traversed.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
// Binary tree node
struct Node {
struct Node* left;
struct Node* right;
int data;
Node(int data)
{
this->data = data;
this->left = NULL;
this->right = NULL;
}
};
// Recursive Function to find height
// of binary tree
int height(struct Node* root)
{
// Base condition
if (root == NULL)
return 0;
// Compute the height of each subtree
int lheight = height(root->left);
int rheight = height(root->right);
// Return the maximum of two
return max(1 + lheight, 1 + rheight);
}
// Function to Print Nodes from left to right
void leftToRight(struct Node* root, int level)
{
if (root == NULL)
return;
if (level == 1)
cout << root->data << " ";
else if (level > 1) {
leftToRight(root->left, level - 1);
leftToRight(root->right, level - 1);
}
}
// Function to Print Nodes from right to left
void rightToLeft(struct Node* root, int level)
{
if (root == NULL)
return;
if (level == 1)
cout << root->data << " ";
else if (level > 1) {
rightToLeft(root->right, level - 1);
rightToLeft(root->left, level - 1);
}
}
// Function to print clockwise spiral
// traversal of a binary tree without using 2D array
void ClockWiseSpiral(struct Node* root)
{
int i = 1;
int j = height(root);
// Flag to mark a change in the direction
// of printing nodes
int flag = 0;
while (i <= j) {
// If flag is zero print nodes
// from left to right
if (flag == 0) {
leftToRight(root, i);
// Set the value of flag as zero
// so that nodes are next time
// printed from right to left
flag = 1;
// Increment i
i++;
}
// If flag is one print nodes
// from right to left
else {
rightToLeft(root, j);
// Set the value of flag as zero
// so that nodes are next time
// printed from left to right
flag = 0;
// Decrement j
j--;
}
}
}
// Driver code
int main()
{
struct Node* root = new Node(10);
root->left = new Node(12);
root->right = new Node(13);
root->right->left = new Node(14);
root->right->right = new Node(15);
root->right->left->left = new Node(21);
root->right->left->right = new Node(22);
root->right->right->left = new Node(23);
root->right->right->right = new Node(24);
ClockWiseSpiral(root);
return 0;
}
// Java implementation of the approach
class GfG
{
// Binary tree node
static class Node
{
Node left;
Node right;
int data;
Node(int data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
// Recursive Function to find height
// of binary tree
static int height(Node root)
{
// Base condition
if (root == null)
return 0;
// Compute the height of each subtree
int lheight = height(root.left);
int rheight = height(root.right);
// Return the maximum of two
return Math.max(1 + lheight, 1 + rheight);
}
// Function to Print Nodes from left to right
static void leftToRight(Node root, int level)
{
if (root == null)
return;
if (level == 1)
System.out.print(root.data + " ");
else if (level > 1)
{
leftToRight(root.left, level - 1);
leftToRight(root.right, level - 1);
}
}
// Function to Print Nodes from right to left
static void rightToLeft(Node root, int level)
{
if (root == null)
return;
if (level == 1)
System.out.print(root.data + " ");
else if (level > 1)
{
rightToLeft(root.right, level - 1);
rightToLeft(root.left, level - 1);
}
}
// Function to print clockwise spiral
// traversal of a binary tree without using 2D array
static void ClockWiseSpiral(Node root)
{
int i = 1;
int j = height(root);
// Flag to mark a change in the direction
// of printing nodes
int flag = 0;
while (i <= j)
{
// If flag is zero print nodes
// from left to right
if (flag == 0)
{
leftToRight(root, i);
// Set the value of flag as zero
// so that nodes are next time
// printed from right to left
flag = 1;
// Increment i
i++;
}
// If flag is one print nodes
// from right to left
else
{
rightToLeft(root, j);
// Set the value of flag as zero
// so that nodes are next time
// printed from left to right
flag = 0;
// Decrement j
j--;
}
}
}
// Driver code
public static void main(String[] args)
{
Node root = new Node(10);
root.left = new Node(12);
root.right = new Node(13);
root.right.left = new Node(14);
root.right.right = new Node(15);
root.right.left.left = new Node(21);
root.right.left.right = new Node(22);
root.right.right.left = new Node(23);
root.right.right.right = new Node(24);
ClockWiseSpiral(root);
}
}
// This code is contributed by Prerna Saini
# Python3 implementation of the approach
# Binary tree
class Node:
# Constructor to create a new node
def __init__(self, data):
self.data = data
self.left = self.right = None
# Recursive Function to find height
# of binary tree
def height(root):
# Base condition
if (root == None):
return 0
# Compute the height of each subtree
lheight = height(root.left)
rheight = height(root.right)
# Return the maximum of two
return max(1 + lheight, 1 + rheight)
# Function to Print Nodes from left to right
def leftToRight(root, level):
if (root == None):
return
if (level == 1):
print(root.data, end = " ")
elif (level > 1):
leftToRight(root.left, level - 1)
leftToRight(root.right, level - 1)
# Function to Print Nodes from right to left
def rightToLeft(root, level):
if (root == None):
return
if (level == 1):
print(root.data ,end=" ")
elif (level > 1):
rightToLeft(root.right, level - 1)
rightToLeft(root.left, level - 1)
# Function to print clockwise spiral
# traversal of a binary tree without using 2D array
def ClockWiseSpiral(root):
i = 1
j = height(root)
# Flag to mark a change in the direction
# of printing nodes
flag = 0
while (i <= j):
# If flag is zero print nodes
# from left to right
if (flag == 0) :
leftToRight(root, i)
# Set the value of flag as zero
# so that nodes are next time
# printed from right to left
flag = 1
# Increment i
i += 1
# If flag is one print nodes
# from right to left
else:
rightToLeft(root, j)
# Set the value of flag as zero
# so that nodes are next time
# printed from left to right
flag = 0
# Decrement j
j -= 1
# Driver code
root = Node(10)
root.left = Node(12)
root.right = Node(13)
root.right.left = Node(14)
root.right.right = Node(15)
root.right.left.left = Node(21)
root.right.left.right = Node(22)
root.right.right.left = Node(23)
root.right.right.right = Node(24)
ClockWiseSpiral(root)
# This code is contributed by SHUBHAMSINGH10
// C# implementation of the approach
using System;
using System.Collections.Generic;
class GfG
{
// Binary tree node
public class Node
{
public Node left;
public Node right;
public int data;
public Node(int data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
// Recursive Function to find height
// of binary tree
static int height(Node root)
{
// Base condition
if (root == null)
return 0;
// Compute the height of each subtree
int lheight = height(root.left);
int rheight = height(root.right);
// Return the maximum of two
return Math.Max(1 + lheight, 1 + rheight);
}
// Function to Print Nodes from left to right
static void leftToRight(Node root, int level)
{
if (root == null)
return;
if (level == 1)
Console.Write(root.data + " ");
else if (level > 1)
{
leftToRight(root.left, level - 1);
leftToRight(root.right, level - 1);
}
}
// Function to Print Nodes from right to left
static void rightToLeft(Node root, int level)
{
if (root == null)
return;
if (level == 1)
Console.Write(root.data + " ");
else if (level > 1)
{
rightToLeft(root.right, level - 1);
rightToLeft(root.left, level - 1);
}
}
// Function to print clockwise spiral
// traversal of a binary tree without using 2D array
static void ClockWiseSpiral(Node root)
{
int i = 1;
int j = height(root);
// Flag to mark a change in the direction
// of printing nodes
int flag = 0;
while (i <= j)
{
// If flag is zero print nodes
// from left to right
if (flag == 0)
{
leftToRight(root, i);
// Set the value of flag as zero
// so that nodes are next time
// printed from right to left
flag = 1;
// Increment i
i++;
}
// If flag is one print nodes
// from right to left
else
{
rightToLeft(root, j);
// Set the value of flag as zero
// so that nodes are next time
// printed from left to right
flag = 0;
// Decrement j
j--;
}
}
}
// Driver code
public static void Main(String[] args)
{
Node root = new Node(10);
root.left = new Node(12);
root.right = new Node(13);
root.right.left = new Node(14);
root.right.right = new Node(15);
root.right.left.left = new Node(21);
root.right.left.right = new Node(22);
root.right.right.left = new Node(23);
root.right.right.right = new Node(24);
ClockWiseSpiral(root);
}
}
/* This code contributed by PrinciRaj1992 */
<script>
// JavaScript implementation of the approach
// Binary tree node
class Node
{
constructor(data) {
this.left = null;
this.right = null;
this.data = data;
}
}
// Recursive Function to find height
// of binary tree
function height(root)
{
// Base condition
if (root == null)
return 0;
// Compute the height of each subtree
let lheight = height(root.left);
let rheight = height(root.right);
// Return the maximum of two
return Math.max(1 + lheight, 1 + rheight);
}
// Function to Print Nodes from left to right
function leftToRight(root, level)
{
if (root == null)
return;
if (level == 1)
document.write(root.data + " ");
else if (level > 1)
{
leftToRight(root.left, level - 1);
leftToRight(root.right, level - 1);
}
}
// Function to Print Nodes from right to left
function rightToLeft(root, level)
{
if (root == null)
return;
if (level == 1)
document.write(root.data + " ");
else if (level > 1)
{
rightToLeft(root.right, level - 1);
rightToLeft(root.left, level - 1);
}
}
// Function to print clockwise spiral
// traversal of a binary tree without using 2D array
function ClockWiseSpiral(root)
{
let i = 1;
let j = height(root);
// Flag to mark a change in the direction
// of printing nodes
let flag = 0;
while (i <= j)
{
// If flag is zero print nodes
// from left to right
if (flag == 0)
{
leftToRight(root, i);
// Set the value of flag as zero
// so that nodes are next time
// printed from right to left
flag = 1;
// Increment i
i++;
}
// If flag is one print nodes
// from right to left
else
{
rightToLeft(root, j);
// Set the value of flag as zero
// so that nodes are next time
// printed from left to right
flag = 0;
// Decrement j
j--;
}
}
}
let root = new Node(10);
root.left = new Node(12);
root.right = new Node(13);
root.right.left = new Node(14);
root.right.right = new Node(15);
root.right.left.left = new Node(21);
root.right.left.right = new Node(22);
root.right.right.left = new Node(23);
root.right.right.right = new Node(24);
ClockWiseSpiral(root);
</script>
Output: 10 24 23 22 21 12 13 15 14
Time Complexity: O(N^2), where N is the total number of nodes in the binary tree.
Auxiliary Space: O(N).
Similar Reads
Clockwise Spiral Traversal of Binary Tree Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. For the above binary tree, the circular clockwise spiral order traversal will be 1, 4, 5, 6, 7, 2, 3. Examples: Input : 10 / \ 12 13 / \ 14 15 / \ / \ 21 22 23 24 Output : 10, 24, 23, 22
15+ min read
Reverse Anti Clockwise Spiral Traversal of a Binary Tree Given a binary tree, the task is to print the nodes of the tree in a reverse anti-clockwise spiral manner. Examples: Input : 1 / \ 2 3 / \ \ 4 5 6 / / \ 7 8 9 Output : 7 8 9 1 4 5 6 3 2 Input : 20 / \ 8 22 / \ / \ 5 3 4 25 / \ 10 14 Output : 10 14 20 5 3 4 25 22 8 Approach: The idea is to use two va
11 min read
Iterative Boundary Traversal of Complete Binary tree Given a complete binary tree, the task is to traverse it such that all the boundary nodes are visited in Anti-Clockwise order starting from the root.Example: Input: Output: 1 2 4 5 6 7 3 Input: Output: 18 15 40 50 100 20 30Approach:Traverse left-most nodes of the tree from top to down. (Left boundar
9 min read
Inorder Tree Traversal of Binary Tree in C++ A binary tree is a non-linear hierarchical data structure in which each node has at most two children known as the left child and the right child. As the binary tree has non-linear structure it can be traversed in multiple ways one such way is in-order traversal which is a depth first (DFS) traversa
4 min read
Zig-Zag traversal of a Binary Tree using Recursion Given a binary tree, the task is to find the zigzag level order traversal of the tree. In zig zag traversal starting from the first level go from left to right for odd-numbered levels and right to left for even-numbered levels. Approach:The zigzag traversal of a binary tree involves traversing the t
11 min read
Print nodes in top view of Binary Tree | Set 2 Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print the top view of it. The output nodes should be printed from left to right. Note: A node x is there in output if x is the topmost node at its horizontal distance. Horizontal distance
14 min read
Level order traversal in spiral form | Using Deque Given a binary tree and the task is to find the spiral order traversal of the tree and return the list containing the elements.Spiral order Traversal mean: Starting from level 0 for root node, for all the even levels we print the node's value from right to left and for all the odd levels we print th
6 min read
Reverse Clockwise spiral traversal of a binary tree Given a Binary Tree. The task is to print the circular reverse clockwise spiral order traversal of the given binary tree.Reverse Clockwise Traversal means to traverse the tree in clockwise direction spirally starting from the bottom instead of top root node.Examples: Input : 1 / \ 2 3 / \ \ 4 5 6 /
11 min read
Anti Clockwise spiral traversal of a binary tree Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2 3 / \ / \ 4 5 6 7 Output: 1 4 5 6 7 3 2 Input: 1 / \ 2 3 / / \ 4 5 6 / \ / / \ 7 8 9 10 11 Output: 1 7 8 9 10 11 3 2 4 5 6 Approach: The idea is to use two variables i initial
15+ min read
Clockwise Triangular traversal of a Binary Tree Given a Complete Binary Tree, the task is to print the elements in the Clockwise traversal order.Clockwise Traversal of a tree is defined as: For the above binary tree, the Clockwise Triangular traversal will be 0, 2, 6, 14, 13, 12, 11, 10, 9, 8, 7, 3, 1, 5, 4 Examples: Input: 1 / \ 2 3 / \ / \ 4 5
13 min read