Trees Data Structures Linear by Sangaraju Hrushikesava (2 results)

Author: 
Title: 
Refine with Advanced Search

Refine your search

  • Books (2)

  • New (2)

to

Custom price range (£)

to

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2021

    6203192775 / 9786203192773

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    £ 31.69

    £ 59.25 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: Neu. Trees in Data Structures | Non linear Data Structures -Various types of Trees | Hrushikesava Raju Sangaraju (u. a.) | Taschenbuch | Englisch | 2021 | LAP LAMBERT Academic Publishing | EAN 9786203192773 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2021

    6203192775 / 9786203192773

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 39.81

    £ 29.63 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Nowadays, Non-linear data structures are very important in a variety of applications. The importance of trees is to make users understand any scenario in a beautiful manner. These trees whatever are discussed in the textbook are very much helpful in analyzing any real-time application and may apply this knowledge in simulating such applications. This book describes the fundamentals of Trees in the nonlinear data structures such as Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees, and B-Trees. Their operations and few examples are demonstrated. The kinds of trees discussed here are binary trees, Binary search trees, Adelson Velski Landis(AVL) Trees, Red-Black Trees, Splay Trees, and B-Trees are mentioned and their operations like searching, insertion, and deletion are also described with suitable examples.…