/binary-search-tree-in-c

Implementation of binary search tree in c

Primary LanguageC

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.