16 Oct 2013 Solution: From the below table of complexities we can clearly see that why one sholud prefer Tree data structure compared to Linked List , Array (Sorted or Unsorted) . I Introduction to BST : A BST is a data structure which is dynamic in nature as Linked Lists. It is advantageous over Linked List or arrays because the basic operations of Add Delete Search Get are cheaper in BST compared to Arrays or Linked List. The performance of operation's mentioned above depends on the height of the Tree. To take care of that ,
Read full article from Coding Recipies: Tree Operations
No comments:
Post a Comment