Skip to content

docs: add comments to BST traversal functions #2831

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 3 commits into from
Closed

docs: add comments to BST traversal functions #2831

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
8b0f2fe
Adding comments for tree traversal
Oct 13, 2024
ffc7c87
Adding example
Oct 13, 2024
c95bcb9
Merge branch 'master' into radhikaBranch
realstealthninja Oct 21, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
56 changes: 34 additions & 22 deletions data_structures/binary_search_tree.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -98,6 +98,10 @@ void BFT(node *n) {
}
}

/*
Prints the preorder traversal starting from the node n
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

please follow doxygen documentation for documenting functions.
https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md

Prints root - leftChild - rightChild
*/
void Pre(node *n) {
if (n != NULL) {
std::cout << n->val << " ";
Expand All @@ -106,6 +110,10 @@ void Pre(node *n) {
}
}

/*
Prints the inorder traversal starting from the node n
Prints leftChild - root - rightChild
*/
void In(node *n) {
if (n != NULL) {
In(n->left);
Expand All @@ -114,6 +122,10 @@ void In(node *n) {
}
}

/*
Prints the postorder traversal starting from the node n
Prints left - rightChild - root
*/
void Post(node *n) {
if (n != NULL) {
Post(n->left);
Expand Down Expand Up @@ -145,28 +157,28 @@ int main() {
std::cin >> ch;
int x;
switch (ch) {
case 1:
std::cout << "\nEnter the value to be Inserted : ";
std::cin >> x;
Insert(root, x);
break;
case 2:
std::cout << "\nEnter the value to be Deleted : ";
std::cin >> x;
Remove(root, root, x);
break;
case 3:
BFT(root);
break;
case 4:
Pre(root);
break;
case 5:
In(root);
break;
case 6:
Post(root);
break;
case 1:
std::cout << "\nEnter the value to be Inserted : ";
std::cin >> x;
Insert(root, x);
break;
case 2:
std::cout << "\nEnter the value to be Deleted : ";
std::cin >> x;
Remove(root, root, x);
break;
case 3:
BFT(root);
break;
case 4:
Pre(root);
break;
case 5:
In(root);
break;
case 6:
Post(root);
break;
}
} while (ch != 0);

Expand Down