You are given a binary tree with ‘N’ nodes. Each node has an integer value associated with it. Your task is to print the leaf nodes and then remove these leaf nodes. Now, print the new leaf nodes and repeat the process until the tree becomes empty.
You don’t require to remove the leaf nodes. Just print the values in the required order. The leaf nodes must be printed in a left to right order.
The first line contains an integer ‘T’, which denotes the number of test cases to be run. Then, the T test cases follow. The first and only line of each test case contains elements of the binary tree in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place. For example, the input for the tree depicted in the below image would be :
6 -3 3 -1 -1 -1 -1
Level 1 : The root node of the tree is 6 Level 2 : Left child of 6 = -3 Right child of 6 = 3 Level 3 : Left child of -3 = null (-1) Right child of -3 = null (-1) Left child of 3 = null (-1) Right child of 3 = null (-1) The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on. The input ends when all nodes at the last level are null (-1).
The above format was just to provide clarity on how the input is formed for a given tree. The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as: 6 -3 3 -1 -1 -1 -1
For each test case, print in a separate line the leaf nodes of the tree. After removing the current leaf nodes, print the new leaf nodes in a separate line. Keep repeating the process until the tree becomes empty. Output for each test case will be printed in a separate line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 100 1 <= N <= 10^5 -10^9 <= node data <= 10^9, (where node data != -1). Time Limit: 1 sec
The approach is to do a Depth First Traversal. For every node, we calculate the order of that node and then push the value of that node in the corresponding vector. The order of a node denotes the number of steps required to remove that node from the tree. The initial set of leaf nodes will have the order 1. After removing them, the next set of leaf nodes will have order 2 and so on and so forth.
- Calculate the height of the tree and store it in a variable, say heightOfTree.
- Now, create a vector of vectors, say allLeaves, to store all the values in the required order. The size of allLeaves must be equal to heightOfTree.
- Now, call the recursive function, storeLeaves(allLeaves, root). This function will fill this vector with all the values in the required order.
- Now, we simply return allLeaves.
int height(BinaryTreeNode<int> *root)
- If node is not present, its height would be considered 0, so return 0.
- The height of a node is 1 more than the maximum height among the height of the left subtree and the right subtree. So, return 1+max(height(root->left), height(root->right)).
int storeLeaves(vector<vector<int>> &allLeaves, BinaryTreeNode<int> *root)
- If the node is not present, return 0, as the order of a non-existing node is considered 0
- The order of a node is 1 more than the maximum order among the order of the left subtree and the right subtree. Note that we are calling the recursive function for the right subtree before the left subtree. This is done to maintain the left to right order of nodes. So, define currLeaf_order = 1+max(storeLeaves(root->right), storeLeaves(root->left)). Now, we can simply push the value of the current node to the vector which contains all the nodes that have the same order. So, allLeaves[currLeaf_order-1].push_back(root->data).
- Return currLeaf_order.