Home > Computer & Internet > Computer programming / software development > Algorithms & data structures > Binary Tree Problems: Must for Interviews and Competitive Coding
8%
Binary Tree Problems: Must for Interviews and Competitive Coding

Binary Tree Problems: Must for Interviews and Competitive Coding

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book "Binary Tree Problems" is carefully crafted to present you the knowledge and practice (around the data structure, Binary Tree) needed to ace Coding Interviews and Competitive Coding Contests.
The book takes you through the fundamentals of Binary Tree, presents how to implement it in a good and secure way, make you practice key problems, present variants like Threaded Binary Tree, Binary Space Partitioning Tree, Skewed Binary Tree, AVL Tree, Treap and much more.

The content covered is deep and is not covered by any other standard book.

Each chapter is followed by a brief note of insight which wraps up your though in the correct direction and is a feast for budding Independent Researchers.
If you aspire you to a good Software Developer, you should definitely get this book. You will be prepared to apply Binary Tree is designing solutions to key real life problems like designing an Excel sheet or making Game Graphics render fast.

Authors: Aditya Chatterjee; Srishti Guleria; Ue Kiao;
Contributors (16): Benjamin QoChuk, Hrithik Shrivastava, Parth Maniyar, Priyanshi Sharma, Rohit Topi, Amruta U. Koshe, Ayush Sonare, Akshay Gopani, Rashmitha, Manasvi Singh, Sahil Silare, Vaibhav Gupta, Vishnu S Reddy, Kyatham Srikanth, Rupali Kavale, Yash Aggarwal;

The topics covered in this book include:

  1. About this book
  2. Binary Tree
  3. Properties of Binary Tree
  4. Implementation of Binary Tree
  5. Implementation of Binary Tree with no NULL
  6. Intuitive View of a Binary Tree
  7. Traversing a Binary Tree (Preorder, Postorder, Inorder)
  8. Convert Inorder+Preorder to Binary Tree (+ other combinations)
  9. Find height or depth of a binary tree
  10. Find Level of each node from root node
  11. Diameter of a Binary Tree
  12. Finding Diameter of a Tree using DFS
  13. Check if a Binary Tree is Balanced by Height
  14. Find number of Universal Value subtrees in a Binary Tree
  15. Counting subtrees where nodes sum to a specific value
  16. Find if a given Binary Tree is a Sub-Tree of another Binary Tree
  17. Check if a Binary Tree has duplicate values
  18. Find nodes which are at a distance k from root in a Binary Tree
  19. Finding nodes at distance K from a given node
  20. Find ancestors of a given node in a binary tree
  21. Largest Independent Set in Binary Tree
  22. Copy a binary tree where each node has a random pointer
  23. Serialization and Deserialization of Binary Tree
  24. 0-1 Encoding of Binary Tree
  25. ZigZag Traversal of Binary Tree
  26. Check if 2 Binary Trees are isomorphic
  27. Convert Binary Tree to Circular Doubly Linked list
  28. Introduction to Skewed Binary Tree
  29. Check if Binary Tree is skewed or not
  30. Change Binary Tree to Skewed Binary Tree
  31. Threaded Binary Tree
  32. Operations in Threaded Binary Tree
  33. Convert Binary Tree to Threaded Binary Tree
  34. Binary Search Tree
  35. Converting a Sorted Array to Binary Tree
  36. Minimum number of swaps to convert a binary tree to binary search tree
  37. Find minimum or maximum element in Binary Search Tree
  38. Convert Binary Search Tree to Balanced Binary Search Tree
  39. Find k-th smallest element in Binary Search Tree
  40. Sum of k smallest elements in Binary Search Tree
  41. Different Self Balancing Binary Trees
  42. AVL Tree
  43. Splay Tree
  44. Binary Space Partitioning Tree
  45. Binary Heap
  46. Treap
  47. Some real problems
  48. Applications & Concluding Note

Published: May 2021 (c) iq.OpenGenus.org


Best Sellers



Product Details
  • ISBN-13: 9798501166677
  • Publisher: Independently Published
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: Must for Interviews and Competitive Coding
  • Width: 178 mm
  • ISBN-10: 8501166677
  • Publisher Date: 12 May 2021
  • Height: 254 mm
  • No of Pages: 374
  • Spine Width: 20 mm
  • Weight: 648 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Binary Tree Problems: Must for Interviews and Competitive Coding
Independently Published -
Binary Tree Problems: Must for Interviews and Competitive Coding
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Binary Tree Problems: Must for Interviews and Competitive Coding

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!