Binary Tree Problems: Must for Interviews and Competitive Coding: 1 (Coding Interviews: Algorithm and Data Structure Proficiency) - Couverture souple

Chatterjee, Aditya; Kiao, Ue; Guleria, Srishti

Couverture souple

ISBN 13 : 9798501166677

Editeur : Independently published, 2021

Synopsis

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 © iq.OpenGenus.org

Détails de l'édition

• Éditeur: Independently published
• Date d'édition: 2021
• Langue: anglais
• ISBN 13: 9798501166677
• Reliure: Tapa blanda
• Nombre de pages: 373
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible