Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 260 Bytes

README.md

File metadata and controls

3 lines (3 loc) · 260 Bytes

Array-Implementation-Of-BST

This is an array implementation of BST along with some non recursive functions in c language. The non-recursive functions are: height of BST, count leaf nodes, check whether it is a complete tree and level order traversal of BST.