Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Program to print the nodes at odd levels of a tree using C++
In this tutorial, we will be discussing a program to print the nodes present at the odd levels of a given binary tree.
In this program, the level for the root node is considered as 1 and simultaneously the alternative level is the next odd level.
For example, let us say we are given with the following binary tree
Then the nodes at the odd levels of this binary tree will be 1, 4, 5, 6.
Example
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
Node* left, *right;
};
//printing the nodes at odd levels
void print_onodes(Node *root, bool is_odd = true){
if (root == NULL)
return;
if (is_odd)
cout << root->data << " " ;
print_onodes(root->left, !is_odd);
print_onodes(root->right, !is_odd);
}
//creating a new node
struct Node* create_node(int data){
struct Node* node = new Node;
node->data = data;
node->left = node->right = NULL;
return (node);
}
int main(){
struct Node* root = create_node(13);
root->left = create_node(21);
root->right = create_node(43);
root->left->left = create_node(64);
root->left->right = create_node(85);
print_onodes(root);
return 0;
}Output
13 64 85
Updated on: 01-Nov-2019
93 Views
Advertisements