[PR #596] [CLOSED] Added postOrder and preOrder functions #1039

New Issue

claunia · 2026-01-29T15:17:01Z

claunia commented

2026-01-29 15:17:01 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/596
Author: @savolla
Created: 8/22/2020
Status: ❌ Closed

Base: master ← Head: feature-preorder-postorder

📝 Commits (1)

5ff9a40 Added postOrder and preOrder functions

📊 Changes

1 file changed (+26 additions, -0 deletions)

View changed files

📝 data_structures/binary_trees/binary_search_tree.c (+26 -0)

📄 Description

Description of Change

Added Preorder and Postorder Traversal functions in Binary Search Tree. In previous version there was only Inorder Traversal. I thought that these operations are also important since they used in various binary search problems like cloning bst (preorder) and deleting bst (postorder)

References

Checklist

Added description of change
Added file name matches File name guidelines
Added tests and example, test must pass
Relevant documentation/comments is changed or added
PR title follows semantic commit guidelines
Search previous suggestions before making a new one, as yours may be a duplicate.
I acknowledge that all my contributions will be made under the project's license.

Notes:

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/596 **Author:** [@savolla](https://github.com/savolla) **Created:** 8/22/2020 **Status:** ❌ Closed **Base:** `master` ← **Head:** `feature-preorder-postorder` --- ### 📝 Commits (1) - [`5ff9a40`](https://github.com/TheAlgorithms/C/commit/5ff9a40338911391c5795149141c2e90d04487f4) Added postOrder and preOrder functions ### 📊 Changes **1 file changed** (+26 additions, -0 deletions) <details> <summary>View changed files</summary> 📝 `data_structures/binary_trees/binary_search_tree.c` (+26 -0) </details> ### 📄 Description #### Description of Change Added Preorder and Postorder Traversal functions in Binary Search Tree. In previous version there was only Inorder Traversal. I thought that these operations are also important since they used in various binary search problems like cloning bst (preorder) and deleting bst (postorder)  #### References  #### Checklist  - [x] Added description of change - [ ] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md#New-File-Name-guidelines) - [ ] Added tests and example, test must pass - [x] Relevant documentation/comments is changed or added - [ ] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x] Search previous suggestions before making a new one, as yours may be a duplicate. - [x] I acknowledge that all my contributions will be made under the project's license. Notes:  <a href="https://gitpod.io/#https://github.com/TheAlgorithms/C/pull/596"><img src="https://gitpod.io/api/apps/github/pbs/github.com/savolla/C.git/5ff9a40338911391c5795149141c2e90d04487f4.svg" /></a> --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:17:01 +00:00

claunia referenced this issue

2026-01-29 15:22:32 +00:00

[PR #1039] add function to insert a node to a singly linked list on a given index #1590

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#1039