Skip to content

Latest commit

 

History

History
5 lines (5 loc) · 351 Bytes

README.md

File metadata and controls

5 lines (5 loc) · 351 Bytes

4th-task-in-data-structures

it's simple program to explain some binary tree functions like how to add , how to delete , how to search firstly what is the binary search tree its a kind of data structures , which consist of a two nodes right node and left tree and root. which have many functions and algorithms such as: insert , search , delete etc.