Skip to content

donheshanthaka/binary-search-tree-in-c

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
bin/Debug
bin/Debug
 
 
obj/Debug
obj/Debug
 
 
README.md
README.md
 
 
binary_search_tree.cbp
binary_search_tree.cbp
 
 
binary_search_tree.depend
binary_search_tree.depend
 
 
main.c
main.c
 
 

Repository files navigation

binary-search-tree-in-c

Implementation of binary search tree in c

Functions:

  1. insert
  2. deleteNode
  3. findMin
  4. findMax
  5. preOrder :- pre-order traversal
  6. inOrder :- in-order traversal
  7. postOrder :- post-order traversal
  • All most all the major functions are implemented as recursive functions.

About

Implementation of binary search tree in c

Topics

c algorithms recursion data-structures binary-search-tree recursive-algorithm in-order algorithms-and-data-structures pre-order post-order

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages