{"product_id":"binary-tree-problems-must-for-interviews-and-competitive-coding-paperback","title":"Binary Tree Problems: Must for Interviews and Competitive Coding - Paperback","description":"\u003cp\u003eby \u003cb\u003eUe Kiao\u003c\/b\u003e (Author), \u003cb\u003eSrishti Guleria\u003c\/b\u003e (Author), \u003cb\u003eHrithik Shrivastava\u003c\/b\u003e (Contribution by)\u003c\/p\u003e\u003cp\u003eThis book \"\u003cb\u003eBinary Tree Problems\u003c\/b\u003e\" 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.\u003cbr\u003eThe 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. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cb\u003eThe content covered is deep and is not covered by any other standard book.\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003eEach 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.\u003cbr\u003eIf 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. \u003cp\u003e\u003c\/p\u003e\u003cb\u003eAuthors\u003c\/b\u003e: Aditya Chatterjee; Srishti Guleria; Ue Kiao;\u003cbr\u003e\u003cb\u003eContributors\u003c\/b\u003e (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; \u003cp\u003e\u003c\/p\u003eThe topics covered in this book include: \u003col\u003e\n\u003cli\u003eAbout this book\u003c\/li\u003e\n\u003cli\u003eBinary Tree\u003c\/li\u003e\n\u003cli\u003eProperties of Binary Tree\u003c\/li\u003e\n\u003cli\u003eImplementation of Binary Tree\u003c\/li\u003e\n\u003cli\u003eImplementation of Binary Tree with no NULL\u003c\/li\u003e\n\u003cli\u003eIntuitive View of a Binary Tree\u003c\/li\u003e\n\u003cli\u003eTraversing a Binary Tree (Preorder, Postorder, Inorder)\u003c\/li\u003e\n\u003cli\u003eConvert Inorder+Preorder to Binary Tree (+ other combinations)\u003c\/li\u003e\n\u003cli\u003eFind height or depth of a binary tree\u003c\/li\u003e\n\u003cli\u003eFind Level of each node from root node\u003c\/li\u003e\n\u003cli\u003eDiameter of a Binary Tree\u003c\/li\u003e\n\u003cli\u003eFinding Diameter of a Tree using DFS\u003c\/li\u003e\n\u003cli\u003eCheck if a Binary Tree is Balanced by Height\u003c\/li\u003e\n\u003cli\u003eFind number of Universal Value subtrees in a Binary Tree\u003c\/li\u003e\n\u003cli\u003eCounting subtrees where nodes sum to a specific value\u003c\/li\u003e\n\u003cli\u003eFind if a given Binary Tree is a Sub-Tree of another Binary Tree\u003c\/li\u003e\n\u003cli\u003eCheck if a Binary Tree has duplicate values\u003c\/li\u003e\n\u003cli\u003eFind nodes which are at a distance k from root in a Binary Tree\u003c\/li\u003e\n\u003cli\u003eFinding nodes at distance K from a given node\u003c\/li\u003e\n\u003cli\u003eFind ancestors of a given node in a binary tree\u003c\/li\u003e\n\u003cli\u003eLargest Independent Set in Binary Tree\u003c\/li\u003e\n\u003cli\u003eCopy a binary tree where each node has a random pointer\u003c\/li\u003e\n\u003cli\u003eSerialization and Deserialization of Binary Tree\u003c\/li\u003e\n\u003cli\u003e0-1 Encoding of Binary Tree\u003c\/li\u003e\n\u003cli\u003eZigZag Traversal of Binary Tree\u003c\/li\u003e\n\u003cli\u003eCheck if 2 Binary Trees are isomorphic\u003c\/li\u003e\n\u003cli\u003eConvert Binary Tree to Circular Doubly Linked list\u003c\/li\u003e\n\u003cli\u003eIntroduction to Skewed Binary Tree\u003c\/li\u003e\n\u003cli\u003eCheck if Binary Tree is skewed or not\u003c\/li\u003e\n\u003cli\u003eChange Binary Tree to Skewed Binary Tree\u003c\/li\u003e\n\u003cli\u003eThreaded Binary Tree\u003c\/li\u003e\n\u003cli\u003eOperations in Threaded Binary Tree\u003c\/li\u003e\n\u003cli\u003eConvert Binary Tree to Threaded Binary Tree\u003c\/li\u003e\n\u003cli\u003eBinary Search Tree\u003c\/li\u003e\n\u003cli\u003eConverting a Sorted Array to Binary Tree\u003c\/li\u003e\n\u003cli\u003eMinimum number of swaps to convert a binary tree to binary search tree\u003c\/li\u003e\n\u003cli\u003eFind minimum or maximum element in Binary Search Tree\u003c\/li\u003e\n\u003cli\u003eConvert Binary Search Tree to Balanced Binary Search Tree\u003c\/li\u003e\n\u003cli\u003eFind k-th smallest element in Binary Search Tree\u003c\/li\u003e\n\u003cli\u003eSum of k smallest elements in Binary Search Tree\u003c\/li\u003e\n\u003cli\u003eDifferent Self Balancing Binary Trees\u003c\/li\u003e\n\u003cli\u003eAVL Tree\u003c\/li\u003e\n\u003cli\u003eSplay Tree\u003c\/li\u003e\n\u003cli\u003eBinary Space Partitioning Tree\u003c\/li\u003e\n\u003cli\u003eBinary Heap\u003c\/li\u003e\n\u003cli\u003eTreap\u003c\/li\u003e\n\u003cli\u003eSome real problems\u003c\/li\u003e\n\u003cli\u003eApplications \u0026amp; Concluding Note\u003c\/li\u003e\n\u003c\/ol\u003e\u003cbr\u003ePublished: May 2021 (c) iq.OpenGenus.org\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 374\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.77 x 10 x 7 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e May 12, 2021\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42728015626303,"sku":"9798501166677","price":40.48,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/00d04677bd2626aa373b2431402d3ab0.webp?v=1765116956","url":"https:\/\/dhl-adrianne.myshopify.com\/products\/binary-tree-problems-must-for-interviews-and-competitive-coding-paperback","provider":"BBB","version":"1.0","type":"link"}