Skip to content

Latest commit

 

History

History
21 lines (16 loc) · 367 Bytes

File metadata and controls

21 lines (16 loc) · 367 Bytes

Binary Search Tree (In work)

The binary structure is the following, each node (an element) has a value (a letter) and can point to other two values.

       (C)
     /     \
   (A)    (E)
         /   \
       (D)   (F)
               \
               (G)
        

Declaring the root,

The entire implementation

Source: