Binary Tree Problems: Must for Interviews and Competitive Coding
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:
About this bookBinary TreeProperties of Binary TreeImplementation of Binary TreeImplementation of Binary Tree with no NULLIntuitive View of a Binary TreeTraversing a Binary Tree (Preorder, Postorder, Inorder)Convert Inorder+Preorder to Binary Tree (+ other combinations)Find height or depth of a binary treeFind Level of each node from root nodeDiameter of a Binary TreeFinding Diameter of a Tree using DFSCheck if a Binary Tree is Balanced by HeightFind number of Universal Value subtrees in a Binary TreeCounting subtrees where nodes sum to a specific valueFind if a given Binary Tree is a Sub-Tree of another Binary TreeCheck if a Binary Tree has duplicate valuesFind nodes which are at a distance k from root in a Binary TreeFinding nodes at distance K from a given nodeFind ancestors of a given node in a binary treeLargest Independent Set in Binary TreeCopy a binary tree where each node has a random pointerSerialization and Deserialization of Binary Tree0-1 Encoding of Binary TreeZigZag Traversal of Binary TreeCheck if 2 Binary Trees are isomorphicConvert Binary Tree to Circular Doubly Linked listIntroduction to Skewed Binary TreeCheck if Binary Tree is skewe
PRP: 232.42 Lei
Acesta este Prețul Recomandat de Producător. Prețul de vânzare al produsului este afișat mai jos.
185.94Lei
185.94Lei
232.42 LeiLivrare in 2-4 saptamani
Descrierea produsului
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:
About this bookBinary TreeProperties of Binary TreeImplementation of Binary TreeImplementation of Binary Tree with no NULLIntuitive View of a Binary TreeTraversing a Binary Tree (Preorder, Postorder, Inorder)Convert Inorder+Preorder to Binary Tree (+ other combinations)Find height or depth of a binary treeFind Level of each node from root nodeDiameter of a Binary TreeFinding Diameter of a Tree using DFSCheck if a Binary Tree is Balanced by HeightFind number of Universal Value subtrees in a Binary TreeCounting subtrees where nodes sum to a specific valueFind if a given Binary Tree is a Sub-Tree of another Binary TreeCheck if a Binary Tree has duplicate valuesFind nodes which are at a distance k from root in a Binary TreeFinding nodes at distance K from a given nodeFind ancestors of a given node in a binary treeLargest Independent Set in Binary TreeCopy a binary tree where each node has a random pointerSerialization and Deserialization of Binary Tree0-1 Encoding of Binary TreeZigZag Traversal of Binary TreeCheck if 2 Binary Trees are isomorphicConvert Binary Tree to Circular Doubly Linked listIntroduction to Skewed Binary TreeCheck if Binary Tree is skewe
Detaliile produsului