Given a binary tree. Find if a given vertical level of the binary tree is sorted or not.

(For the case when two nodes are overlapping, check if they form a sorted sequence in the level they lie.)

**Prerequisite:** Vertical Order Traversal

Examples:

Input : 1 / \ 2 5 / \ 7 4 / 6 Level l = -1 Output : Yes Nodes in level -1 are 2 -> 6 which forms a sorted sequence. Input: 1 / \ 2 6 \ / 3 4 Level l = 0 Output : Yes Note that nodes with value 3 and 4 are overlapping in the binary tree. So we check if this form a sorted sequence level wise. The sequence formed at level 0 is 1 -> 3 -> 4 which is sorted.

A **simple **solution is to first do level order traversal of the binary tree and store each vertical level in different arrays. After this check, if array corresponding to level l is sorted or not. This solution has large memory requirements that can be reduced.

A **efficient **solution is to do vertical level order traversal of the binary tree and keep track of node values in vertical level l of the binary tree. A sequence is sorted if the previous element is less than or equal to the current element. While doing vertical level order traversal store previous value and compare current node in vertical level l with this previous value of level l. If current node value is greater than or equal to the previous value, then repeat the same procedure until the end of level l. If at any stage current node value is less than previous value then the level l is not sorted. If we reach at the end of level l then the level is sorted.

**Implementation:**

## C++

`// CPP program to determine whether` `// vertical level l of binary tree` `// is sorted or not.` `#include <bits/stdc++.h>` `using` `namespace` `std;` ` ` `// Structure of a tree node.` `struct` `Node {` ` ` `int` `key;` ` ` `Node *left, *right;` `};` ` ` `// Function to create new tree node.` `Node* newNode(` `int` `key)` `{` ` ` `Node* temp = ` `new` `Node;` ` ` `temp->key = key;` ` ` `temp->left = temp->right = NULL;` ` ` `return` `temp;` `}` ` ` `// Helper function to determine if` `// vertical level l of given binary` `// tree is sorted or not.` `bool` `isSorted(Node* root, ` `int` `level)` `{` ` ` `// If root is null, then the answer is an` ` ` `// empty subset and an empty subset is` ` ` `// always considered to be sorted.` ` ` `if` `(root == NULL) ` ` ` `return` `true` `;` ` ` ` ` `// Variable to store previous` ` ` `// value in vertical level l.` ` ` `int` `prevVal = INT_MIN;` ` ` ` ` `// Variable to store current level` ` ` `// while traversing tree vertically.` ` ` `int` `currLevel;` ` ` ` ` `// Variable to store current node` ` ` `// while traversing tree vertically.` ` ` `Node* currNode;` ` ` ` ` `// Declare queue to do vertical order` ` ` `// traversal. A pair is used as element` ` ` `// of queue. The first element in pair` ` ` `// represents the node and the second` ` ` `// element represents vertical level` ` ` `// of that node.` ` ` `queue<pair<Node*, ` `int` `> > q;` ` ` ` ` `// Insert root in queue. Vertical level` ` ` `// of root is 0.` ` ` `q.push(make_pair(root, 0));` ` ` ` ` `// Do vertical order traversal until` ` ` `// all the nodes are not visited.` ` ` `while` `(!q.empty()) {` ` ` `currNode = q.front().first;` ` ` `currLevel = q.front().second;` ` ` `q.pop();` ` ` ` ` `// Check if level of node extracted from` ` ` `// queue is required level or not. If it` ` ` `// is the required level then check if` ` ` `// previous value in that level is less` ` ` `// than or equal to value of node.` ` ` `if` `(currLevel == level) {` ` ` `if` `(prevVal <= currNode->key) ` ` ` `prevVal = currNode->key; ` ` ` `else` ` ` `return` `false` `; ` ` ` `}` ` ` ` ` `// If left child is not NULL then push it` ` ` `// in queue with level reduced by 1.` ` ` `if` `(currNode->left)` ` ` `q.push(make_pair(currNode->left, currLevel - 1));` ` ` ` ` `// If right child is not NULL then push it` ` ` `// in queue with level increased by 1.` ` ` `if` `(currNode->right)` ` ` `q.push(make_pair(currNode->right, currLevel + 1));` ` ` `}` ` ` ` ` `// If the level asked is not present in the` ` ` `// given binary tree, that means that level` ` ` `// will contain an empty subset. Therefore answer` ` ` `// will be true.` ` ` `return` `true` `;` `}` ` ` `// Driver program` `int` `main()` `{` ` ` `/*` ` ` `1` ` ` `/ \` ` ` `2 5` ` ` `/ \` ` ` `7 4` ` ` `/` ` ` `6` ` ` `*/` ` ` ` ` `Node* root = newNode(1);` ` ` `root->left = newNode(2);` ` ` `root->right = newNode(5);` ` ` `root->left->left = newNode(7);` ` ` `root->left->right = newNode(4);` ` ` `root->left->right->left = newNode(6);` ` ` ` ` `int` `level = -1;` ` ` `if` `(isSorted(root, level) == ` `true` `)` ` ` `cout << ` `"Yes"` `;` ` ` `else` ` ` `cout << ` `"No"` `;` ` ` `return` `0;` `}` |

## Python3

`# Python program to determine whether` `# vertical level l of binary tree` `# is sorted or not.` `from` `collections ` `import` `deque` `from` `sys ` `import` `maxsize` ` ` `INT_MIN ` `=` `-` `maxsize` ` ` `# Structure of a tree node.` `class` `Node:` ` ` `def` `__init__(` `self` `, key):` ` ` `self` `.key ` `=` `key` ` ` `self` `.left ` `=` `None` ` ` `self` `.right ` `=` `None` ` ` `# Helper function to determine if` `# vertical level l of given binary` `# tree is sorted or not.` `def` `isSorted(root: Node, level: ` `int` `) ` `-` `> ` `bool` `:` ` ` ` ` `# If root is null, then the answer is an` ` ` `# empty subset and an empty subset is` ` ` `# always considered to be sorted.` ` ` `if` `root ` `is` `None` `:` ` ` `return` `True` ` ` ` ` `# Variable to store previous` ` ` `# value in vertical level l.` ` ` `prevVal ` `=` `INT_MIN` ` ` ` ` `# Variable to store current level` ` ` `# while traversing tree vertically.` ` ` `currLevel ` `=` `0` ` ` ` ` `# Variable to store current node` ` ` `# while traversing tree vertically.` ` ` `currNode ` `=` `Node(` `0` `)` ` ` ` ` `# Declare queue to do vertical order` ` ` `# traversal. A pair is used as element` ` ` `# of queue. The first element in pair` ` ` `# represents the node and the second` ` ` `# element represents vertical level` ` ` `# of that node.` ` ` `q ` `=` `deque()` ` ` ` ` `# Insert root in queue. Vertical level` ` ` `# of root is 0.` ` ` `q.append((root, ` `0` `))` ` ` ` ` `# Do vertical order traversal until` ` ` `# all the nodes are not visited.` ` ` `while` `q:` ` ` `currNode ` `=` `q[` `0` `][` `0` `]` ` ` `currLevel ` `=` `q[` `0` `][` `1` `]` ` ` `q.popleft()` ` ` ` ` `# Check if level of node extracted from` ` ` `# queue is required level or not. If it` ` ` `# is the required level then check if` ` ` `# previous value in that level is less` ` ` `# than or equal to value of node.` ` ` `if` `currLevel ` `=` `=` `level:` ` ` `if` `prevVal <` `=` `currNode.key:` ` ` `prevVal ` `=` `currNode.key` ` ` `else` `:` ` ` `return` `False` ` ` ` ` `# If left child is not NULL then push it` ` ` `# in queue with level reduced by 1.` ` ` `if` `currNode.left:` ` ` `q.append((currNode.left, currLevel ` `-` `1` `))` ` ` ` ` `# If right child is not NULL then push it` ` ` `# in queue with level increased by 1.` ` ` `if` `currNode.right:` ` ` `q.append((currNode.right, currLevel ` `+` `1` `))` ` ` ` ` `# If the level asked is not present in the` ` ` `# given binary tree, that means that level` ` ` `# will contain an empty subset. Therefore answer` ` ` `# will be true.` ` ` `return` `True` ` ` `# Driver Code` `if` `__name__ ` `=` `=` `"__main__"` `:` ` ` ` ` `# /*` ` ` `# 1` ` ` `# / \` ` ` `# 2 5` ` ` `# / \` ` ` `# 7 4` ` ` `# /` ` ` `# 6` ` ` `# */` ` ` ` ` `root ` `=` `Node(` `1` `)` ` ` `root.left ` `=` `Node(` `2` `)` ` ` `root.right ` `=` `Node(` `5` `)` ` ` `root.left.left ` `=` `Node(` `7` `)` ` ` `root.left.right ` `=` `Node(` `4` `)` ` ` `root.left.right.left ` `=` `Node(` `6` `)` ` ` ` ` `level ` `=` `-` `1` ` ` `if` `isSorted(root, level):` ` ` `print` `(` `"Yes"` `)` ` ` `else` `:` ` ` `print` `(` `"No"` `)` ` ` `# This code is contributed by` `# sanjeev2552` |

**Output:**

Yes

**Time Complexity:** O(n)**Auxiliary Space:** O(n)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer **Complete Interview Preparation Course****.**