[EN] Mastering Binary Search Tree - BST


  • Global Moderator

    A #Binary #Search #Tree (#BST), Ordered Tree or Sorted Binary is the first tree #datastructure we are studying. Unlike Arrays, Linked Lists, Stacks and Queues which are linear data structures, a Tree is a hierarchical (and nonlinear) data structure which is intrinsically recursive. Still, BST are easy to understand and manipulate.

    Illustrated course is available in both English and French language:
    https://hurna.io/academy/data_structures/bst.html (en)
    https://hurna.io/fr/academy/data_structures/bst.html (fr)

    As usual, the source code is available in our github. We also have added some cheat sheets about complexity within data structure and sorting algorithm indexes.

    Stay connected for more advanced courses.

    H.urna - Science for everyone.


Log in to reply
 

| |