Binary Tree Problems: Must for Interviews and Competitive Coding (Coding Interviews: Algorithm and Data Structure Proficiency)
Language: English
Published by Independently published, 2021
Series: Book 1 of 10 - Coding Interviews: Algorithm and Data Structure Proficiency
- Softcover
- New

Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
AbeBooks seller since March 25, 2015
Condition: New
US$ 35.64
Quantity: Over 20 available
Add to basketItem description from seller
In English.
Seller Inventory # ria9798501166677_new
- Title
- Binary Tree Problems: Must for Interviews and Competitive Coding (Coding Interviews: Algorithm and Data Structure Proficiency)
- Author
- Chatterjee, Aditya; Kiao, Ue; Guleria, Srishti
- Publisher
- Independently published
- Publication year
- 2021
- Condition
- New
- Binding
- Soft cover
- Language
- English
- ISBN 13
- 9798501166677
- Item weight
- 769 grams
- Series
- Book 1 of 10: Coding Interviews: Algorithm and Data Structure Proficiency
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:
- About this book
- Binary Tree
- Properties of Binary Tree
- Implementation of Binary Tree
- Implementation of Binary Tree with no NULL
- Intuitive View of a Binary Tree
- Traversing a Binary Tree (Preorder, Postorder, Inorder)
- Convert Inorder+Preorder to Binary Tree (+ other combinations)
- Find height or depth of a binary tree
- Find Level of each node from root node
- Diameter of a Binary Tree
- Finding Diameter of a Tree using DFS
- Check if a Binary Tree is Balanced by Height
- Find number of Universal Value subtrees in a Binary Tree
- Counting subtrees where nodes sum to a specific value
- Find if a given Binary Tree is a Sub-Tree of another Binary Tree
- Check if a Binary Tree has duplicate values
- Find nodes which are at a distance k from root in a Binary Tree
- Finding nodes at distance K from a given node
- Find ancestors of a given node in a binary tree
- Largest Independent Set in Binary Tree
- Copy a binary tree where each node has a random pointer
- Serialization and Deserialization of Binary Tree
- 0-1 Encoding of Binary Tree
- ZigZag Traversal of Binary Tree
- Check if 2 Binary Trees are isomorphic
- Convert Binary Tree to Circular Doubly Linked list
- Introduction to Skewed Binary Tree
- Check if Binary Tree is skewed or not
- Change Binary Tree to Skewed Binary Tree
- Threaded Binary Tree
- Operations in Threaded Binary Tree
- Convert Binary Tree to Threaded Binary Tree
- Binary Search Tree
- Converting a Sorted Array to Binary Tree
- Minimum number of swaps to convert a binary tree to binary search tree
- Find minimum or maximum element in Binary Search Tree
- Convert Binary Search Tree to Balanced Binary Search Tree
- Find k-th smallest element in Binary Search Tree
- Sum of k smallest elements in Binary Search Tree
- Different Self Balancing Binary Trees
- AVL Tree
- Splay Tree
- Binary Space Partitioning Tree
- Binary Heap
- Treap
- Some real problems
- Applications & Concluding Note
Published: May 2021 © iq.OpenGenus.org
"Synopsis" may belong to another edition of this title.
Ria Christie Collections
Uxbridge, United Kingdom
AbeBooks seller since March 25, 2015
Shipping rates from United Kingdom to U.S.A.
| Item | 6 to 12 business days | 6 to 12 business days |
|---|---|---|
| First item | US$ 15.11 | US$ 17.38 |
Payment methods
Store description
Hello! Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers. Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this. Our other objectives are to: 1. Ensure that all our products reach their destination quickly in a safe and secure manner 2. Answer to all our customer queries within 24 hours 3. Ensure that our customers are happy with their purchases 4. Provide all the items at a competitive price 5. Always listen to our customers Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below: Contact Person Name: Rakesh Luchmun (Mr) Storefront Name: Ria Christie Collections Place of Establishment Address: Suite B; ARUN House; ARUN Building Arundel Road Uxbridge UB8 2RR United Kingdom E-Mail Address: riachristie@hotmail.co.uk VAT Number: GB 160 5650 25 We always work hard and aim to comply with all of Abebooks Policies. If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours. Thank you kindly! Yours sincerely Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team…
Specialty
Educational books, Textbooks, Fiction, Non- fictionSeller's business information
Ryefield Investments Limited
175 Pield Heath Road
Uxbridge, United Kingdom UB8 3NL
Terms of sale
All Returns and Refund are as per Abebooks policies.
Shipping terms
Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!