How are all leaves of a binary search tree printed in C++

C++

🤖 Code Explanation

void printBoundaryLeft(struct node* root) {

if (root == NULL) return;

if (root->left) {

cout << root->data << " ";

printBoundaryLeft(root->left);
}

else if (root->right) {
cout << root->data << " ";
printBoundaryLeft(root->right);
}
}

void printBoundaryRight(struct node* root) {

if (root == NULL) return;

if (root->right) {
printBoundaryRight(root->right);
cout << root->data << " ";
}

else if (root->left) {
printBoundaryRight(root->left);
cout << root->data << " ";
}
}

void printBoundary(struct node* root

More problems solved in C++

Download SpellBox today