How can I find better fashion options for this search?
Use related searches, refine your keywords by style or occasion, and compare multiple product cards before opening store pages.
Bfs Binary Tree Java
120 results discovered for Bfs Binary Tree Java. Refine by style, occasion, or category to find more relevant fashion products.
Debug Information
Array
(
[meilisearch] => Array
(
[url] => https://msin.fadunews.in/indexes/zipri/search
[http_code] => 200
[response] => {"hits":[],"query":"Bfs-Binary-Tree-Java","processingTimeMs":2,"limit":3,"offset":0,"estimatedTotalHits":0}
[curl_error] =>
[parsed] => Array
(
[hits] => Array
(
)
[query] => Bfs-Binary-Tree-Java
[processingTimeMs] => 2
[limit] => 3
[offset] => 0
[estimatedTotalHits] => 0
)
)
[image_search] => Array
(
[url] => http://206.189.178.169:3001/?freshness=All&show=1&q=Bfs-Binary-Tree-Java+INR+loc%3Ain
[http_code] => 200
[response] => {"name":"bfs-binary-tree-java inr loc:in","totalEstimatedMatches":128,"nextOffset":120,"currentOffset":0,"value":{"F236706A6396957D2EB5A5EF1A19F27B06224B72":{"name":"Virtual Labs","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.ugX0d96v4ah3ETo0tAXTZgHaGn?pid=Api","datePublished":"2021-03-23T09:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/images/bfs.jpeg","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/breadth-first-traversal-theory.html","contentSize":"40472 B","width":651,"height":581,"cDNContentUrl":"https://th.bing.com/th/id/R.ba05f477deafe1a877113a34b405d366?rik=L2MHpjZpWdfiWw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"27B42260B72F91A1FE5A5BE2D7596936A607632F","accentColor":"2777A4"},"988A670F0A852D1015AF6ED37B8543EBBF86BDA3":{"name":"BINARY TREES","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.6yxBblOztneqdcSHFc03fwHaFv?pid=Api","datePublished":"2020-08-04T09:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree10.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm","contentSize":"192757 B","width":1596,"height":1236,"cDNContentUrl":"https://th.bing.com/th/id/R.eb2c416e53b3b677aa75c48715cd377f?rik=iah28KBY0gFR%2bg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3ADB68FBBE3458B73DE6FA5101D258A0F076A889","accentColor":"C63A05"},"A40A32EB853A88BAF9AD6B07F440346E4C40BC8E":{"name":"Java - Binary Trees - Java - DSA Trees 1. Build Tree from given ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.cLKm9BfuMqgJD9zEVvx_6wHaJl?pid=Api","datePublished":"2024-06-13T16:17:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4c5374913f3b9ef3b84a1c82e22f154a/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/gl-bajaj-institute-of-technology-and-management/data-structure/java-binary-trees/92824002","contentSize":"162944 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.70b2a6f417ee32a8090fdcc456fc7feb?rik=SqAjvlijiKuf2g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E8CB04C4E643044F70B6DA9FAB88A358BE23A04A","accentColor":"345A4E"},"F8402F38D83AAAA3B1057044EE481578A6EB7F3D":{"name":"BFS-BREADTH FIRST SEARCH","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.dnfqKjmcyx9cKR9p0c0x_AHaD0?pid=Api","datePublished":"2020-10-05T17:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode30.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm","contentSize":"96624 B","width":1282,"height":662,"cDNContentUrl":"https://th.bing.com/th/id/R.7677ea2a399ccb1f5c291f69d1cd31fc?rik=jwTyg42jqjobUA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D3F7BE6A875184EE4407501B3AAAA38D83F2048F","accentColor":"C73904"},"BD023B28125035B288B7D721519EE455A2EC625E":{"name":"Programming in C: Tree BFS","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.youRThjpCB0vfo4EVTVPWAAAAA?pid=Api","datePublished":"2018-05-03T05:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=15325516965057815059","hostPageUrl":"https://gateoverflow.in/105129/tree-bfs","contentSize":"31166 B","width":386,"height":376,"cDNContentUrl":"https://th.bing.com/th/id/R.ca8b914e18e9081d2f7e8e0455354f58?rik=2yCzgiEFUyuIew&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E526CE2A554EE915127D7B882B53052182B320DB","accentColor":"A93F22"},"FC5A00AA02E2609F298EDB89DF1E2A795BA7B82F":{"name":"Virtual Labs","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.OmRV7P0YluY2ToRj44jKGAAAAA?pid=Api","datePublished":"2021-03-23T10:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/binary-search-trees/analysis/images/Binary_search_tree_example.gif","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/binary-search-trees/analysis/relationships.html","contentSize":"123777 B","width":450,"height":378,"proxyContentUrl":"https://tse3.mm.bing.net/th/id/OGC.3a6455ecfd1896e6364e8463e388ca18?pid=Api&rurl=https%3a%2f%2fds1-iiith.vlabs.ac.in%2fexp%2fbinary-search-trees%2fanalysis%2fimages%2fBinary_search_tree_example.gif&ehk=LrsLhUAGxY3wzUycvq4VqR3F3HRFTVbHDBWzMoh7BE8%3d","cDNContentUrl":"https://th.bing.com/th/id/R.3a6455ecfd1896e6364e8463e388ca18?rik=z6UAqiAuBvmS6A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F28B7AB597A2E1FD98BDE892F9062E20AA00A5CF","accentColor":"B45E17"},"DFAA130D99C395646FC605DFB2DF8DD40AF76DA1":{"name":"BFS vs DFS for Binary Tree - Class 8 PDF Download","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.GGlHYP-RglnmphEiSXAQTQAAAA?pid=Api","datePublished":"2022-05-31T21:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/12234737_26d6f0fb-b3b0-42f2-a6db-18df75c754bd_lg.png","hostPageUrl":"https://edurev.in/t/230690/BFS-vs-DFS-for-Binary-Tree","contentSize":"7569 B","width":289,"height":170,"cDNContentUrl":"https://th.bing.com/th/id/R.18694760ff918259e6a611224970104d?rik=%2faox0Jk8WUb2bA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1AD67FA04DD8FD2BFD506CF646593C99D031AAFD","accentColor":"963B35"},"6EEA66ADA9B6356F1E33BA6F7E18994902A9644F":{"name":"Explain DFS and BFS with example | summer-2014","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.X4p-jhXiN1G3L9RtLPzjuQAAAA?pid=Api","datePublished":"2020-12-26T17:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/BFS_Example.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a","contentSize":"7469 B","width":381,"height":179,"cDNContentUrl":"https://th.bing.com/th/id/R.5f8a7e8e15e23751b72fd46d2cfce3b9?rik=5q5m2pprU%2fbhMw&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fBFS_Example.png&ehk=dra2N96gsHnbuXImuqLsn2s4aaZekXzIqw2zN81fHpE%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F4469A20949981E7F6AB33E1F6536B9ADA66AEE6","accentColor":"3C3C3C"},"BAF205C6708699B38029CB7A8C7A6C3B34E20B31":{"name":"BINARY SEARCH TREE","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.HTZPpkDoijdfvHorMp5PWAHaHD?pid=Api","datePublished":"2020-08-04T06:02:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Binarysearchtree11.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search-Tree.htm","contentSize":"54120 B","width":578,"height":550,"cDNContentUrl":"https://th.bing.com/th/id/R.1d364fa640e88a375fbc7a2b329e4f58?rik=qy9QbAdomTsIkg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"13B02E43B3C6A7C8A7BC92083B9968076C502FAB","accentColor":"C73904"},"E7F326CB693DFA6ED4425FAA85D9FB2E4DF5C40B":{"name":"T03a.Binary Tree Theorems - Full and Complete Binary Trees Here are two ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.-VYQGCr9Kru1yhOXedrtogHaFu?pid=Api","datePublished":"2023-09-25T14:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/344eaad31a79e619fd4abff90f63a054/thumb_1200_927.png","hostPageUrl":"https://www.studocu.com/in/document/guru-nanak-dev-university/btech-computer-science-engineering/t03abinary-tree-theorems/70243009","contentSize":"142589 B","width":1200,"height":927,"cDNContentUrl":"https://th.bing.com/th/id/R.f95610182afd2abbb5ca139779daeda2?rik=fj9ivJbTr%2bZNJA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B04C5FD4E2BF9D58AAF5244DE6AFD396BC623F7E","accentColor":"CC4E00"},"CA1B3CB388FA599A94BD6ED37B8543EBBF86BDA3":{"name":"BINARY TREES","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.BUzl-WjOcVcrdCAJ7RF68gHaI9?pid=Api","datePublished":"2020-08-04T09:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree7.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm","contentSize":"120617 B","width":984,"height":1190,"cDNContentUrl":"https://th.bing.com/th/id/R.054ce5f968ce71572b742009ed117af2?rik=rLHDO4ivlalJ2w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3ADB68FBBE3458B73DE6DB49A995AF883BC3B1AC","accentColor":"C63905"},"5D5E57927023D934B11CB07FA36B8180D0ACDE2F":{"name":"257. Binary Tree Paths - Easy | DSA Corner | Talentd","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP._xzbrE8VFzCCZrO6DXGOgwAAAA?pid=Api","datePublished":"2025-04-21T16:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/binary-tree-paths","contentSize":"8238 B","width":207,"height":293,"cDNContentUrl":"https://th.bing.com/th/id/R.ff1cdbac4f1517308266b3ba0d718e83?rik=1eV1KQcynUMbwQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F2EDCA0D0818B63AF70BC11B439D32072975E5D5","accentColor":"666666"},"B2A0817CB630605F52B6E757C6BA473B6516C0F8":{"name":"Explain Threaded binary trees with suitable examples. | summer-2019","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.iCYaK-6udZlLD4I4wj6RCQAAAA?pid=Api","datePublished":"2022-12-13T01:07:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://www.gtu-paper-solution.com/upload/2130702/Question_Images/Binary_Tree_For_TBT.png","hostPageUrl":"https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2019/Question-5-b","contentSize":"24941 B","width":321,"height":326,"cDNContentUrl":"https://th.bing.com/th/id/R.88261a2beeae75994b0f8238c23e9109?rik=KwoYx2sDBvUlaw&riu=http%3a%2f%2fwww.gtu-paper-solution.com%2fupload%2f2130702%2fQuestion_Images%2fBinary_Tree_For_TBT.png&ehk=7TidEzMEI%2bOjFGnzR2brJr6bZkhYxGtBWz7bpgoE7P4%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8F0C6156B374AB6C757E6B25F506036BC7180A2B","accentColor":"2A76A1"},"ACAB20C807173698C79EC887D52617C65A83977E":{"name":"BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.4HOcdm_bd_oTJsHRlI-3swAAAA?pid=Api","datePublished":"2022-11-28T18:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_3270b03b-cb1b-4402-abce-6e9e1281de36_lg.png","hostPageUrl":"https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm","contentSize":"13024 B","width":248,"height":276,"cDNContentUrl":"https://th.bing.com/th/id/R.e0739c766fdb77fa1326c1d1948fb7b3?rik=yroCjHBxY4l86Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E77938A56C71625D788CE97C896371708C02BACA","accentColor":"666666"},"EE89DE11E3B672BB3D7BF8DB08363306AE05068F":{"name":"Binary Search Algorithm | Step-by-Step Animation","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.vO61I_gV42-tD6sHxtS9oAHaDt?pid=Api","datePublished":"2025-04-11T19:02:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://dsavisualizer.in/og/searching/binarySearch.png","hostPageUrl":"https://www.dsavisualizer.in/visualizer/searching/binarysearch","contentSize":"135307 B","width":3780,"height":1890,"cDNContentUrl":"https://th.bing.com/th/id/R.bceeb523f815e36fad0fab07c6d4bda0?rik=7pjtET5rJ7vTtw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F86050EA60336380BD8FB7D3BB276B3E11ED98EE","accentColor":"00B853"},"26811BC36D932757E8E845BDD6BDA28155325842":{"name":"Full Binary Tree vs Complete binary tree in data structure - Full ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.Th4mBm9W4Y4rkYvtkk9nuQHaKe?pid=Api","datePublished":"2022-05-08T19:51:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a3a9b112088655a821d1318bb8e6a34c/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/full-binary-tree-vs-complete-binary-tree-in-data-structure/22769253","contentSize":"225017 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.4e1e26066f56e18e2b918bed924f67b9?rik=YhixPNY5cnWOjg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"24852355182ADB6DDB548E8E757239D63CB11862","accentColor":"254564"},"87331BB00776433B55EF83C1E4F58FDA6CBF3112":{"name":"Binary Tree Node in SQL : Online Learning Center","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Y2EzEPMK49Os3OEHzftaawAAAA?pid=Api","datePublished":"2023-02-19T20:00:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.onlinelearningcenter.in/files/blog/post/245/img-0.png","hostPageUrl":"https://www.onlinelearningcenter.in/blog/database/sql/basic/binary-tree-node-in-sql","contentSize":"88829 B","width":474,"height":251,"cDNContentUrl":"https://th.bing.com/th/id/R.63613310f30ae3d3acdce107cdfb5a6b?rik=eDOxC3BnNLNV%2fg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2113FBC6ADF85F4E1C38FE55B33467700BB13378","accentColor":"C3A208"},"4DA14847713F6B3DD3FE3C57F5F57760CC9946EC":{"name":"DS: DS-BFS","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.pXXsVJoLY4ruKQQynNKHLAHaFj?pid=Api","datePublished":"2017-06-19T06:21:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=2037941273239483355","hostPageUrl":"https://gateoverflow.in/103780/ds-bfs","contentSize":"11909 B","width":600,"height":450,"cDNContentUrl":"https://th.bing.com/th/id/R.a575ec549a0b638aee2904329cd2872c?rik=1BqEdBfzttM97w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CE6499CC06775F5F75C3EF3DD3B6F31774841AD4","accentColor":"1D1D1D"},"2CF71B730FAE8A349B68DAA4BD587AE267A5B155":{"name":"What are the types of threaded binary tree explain with example ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.bEO5bHY1tLQYL-vtoI9hUAHaFQ?pid=Api","datePublished":"2018-05-29T11:26:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d80/a95860b2c22150f4d0b7036a7833381a.jpg","hostPageUrl":"https://brainly.in/question/3786858","contentSize":"65372 B","width":711,"height":505,"cDNContentUrl":"https://th.bing.com/th/id/R.6c43b96c7635b4b4182febeda08f6150?rik=wn%2bxN%2fDqqEO5hg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"551B5A762EA785DB4AAD86B943A8EAF037B17FC2","accentColor":"A79224"},"23543DF81F4BA12452576ED37B8543EBBF86BDA3":{"name":"BINARY TREES","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Aqseg7pufThZM7pVrrLkowAAAA?pid=Api","datePublished":"2020-08-04T09:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree8.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm","contentSize":"45432 B","width":442,"height":396,"cDNContentUrl":"https://th.bing.com/th/id/R.02ab1e83ba6e7d385933ba55aeb2e4a3?rik=MkXTj%2fG0GkIldQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3ADB68FBBE3458B73DE67525421AB4F18FD34532","accentColor":"C83803"},"07F864B852A3CF5AB171B62B0CBC057B3BB74E0A":{"name":"4.2 Binary Trees","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.86yN7ef31_93tbP-ngzTmgHaB3?pid=Api","datePublished":"2014-11-28T17:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img158.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node87.html","contentSize":"4741 B","width":1003,"height":253,"cDNContentUrl":"https://th.bing.com/th/id/R.f3ac8dede7f7d7ff77b5b3fe9e0cd39a?rik=cI9GiyU6%2fKUbFw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0E47BB3B750CBC0B26B171BA5FC3A258B468F70","accentColor":"3E3E3E"},"57EE0FAA071532C7694D0EC44CB3C71CF5993D47":{"name":"Explain with example DFS and BFS traversal of graph. | Winter-2015","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?pid=Api","datePublished":"2021-01-04T12:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png","hostPageUrl":"https://www.gtu-paper-solution.com/Paper-Solution/DataStructure-2130702/Winter-2015/Question-5-b","contentSize":"24185 B","width":406,"height":230,"cDNContentUrl":"https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"74D3995FC17C3BC44CE0D4967C235170AAF0EE75","accentColor":"9A6C31"},"A76667F5069D5CCFA013F938735C3CC00A7CBFF5":{"name":"BINARY SEARCH","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.QWoUzrysQ-J7LkcnEGRYxwHaGj?pid=Api","datePublished":"2020-08-04T08:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinarySearching8.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search.htm","contentSize":"30336 B","width":997,"height":883,"cDNContentUrl":"https://th.bing.com/th/id/R.416a14cebcac43e27b2e4727106458c7?rik=emZ2X2DZxfwKMQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FFBC7A00CC3C537839F310AFCC5D9605F76667A","accentColor":"BC0F1A"},"F2C9A1793D353689AC81FA1A0809F0EF898A8269":{"name":"Univalued Binary Tree - DSA Problem | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.9AsZU7xlDAI9Iyy0oDRZ9gAAAA?pid=Api","datePublished":"2025-04-21T18:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2018/12/28/unival_bst_2.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/univalued-binary-tree","contentSize":"7159 B","width":198,"height":169,"cDNContentUrl":"https://th.bing.com/th/id/R.f40b1953bc650c023d232cb4a03459f6?rik=L5wal9NTY5jKGA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9628A898FE0F9080A1AF18CA986353D3971A9C2F","accentColor":"516D7A"},"A45664C42681C86D6B466ED37B8543EBBF86BDA3":{"name":"BINARY TREES","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.RtLqSxNtCr-jdNtkrpAylgHaHa?pid=Api","datePublished":"2020-08-04T09:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/logo.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm","contentSize":"123040 B","width":500,"height":500,"cDNContentUrl":"https://th.bing.com/th/id/R.46d2ea4b136d0abfa374db64ae903296?rik=SmVGTGIYjNa2ZA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3ADB68FBBE3458B73DE664B6D68C18624C46654A","accentColor":"C49E07"},"635E8BC9650E2CF60EA746A8D716D86453ACE3A8":{"name":"BFS.pdf - BFS ALGORITHM import java.*; public class bfs { private int V ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fjd7u5rVAhh7B1PROwgYawHaKe?pid=Api","datePublished":"2024-04-16T08:49:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/47e64d60d8d5e46ce9965eceacb52c19/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/bfspdf/90024442","contentSize":"60026 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.7e377bbb9ad502187b0753d13b08186b?rik=NuW4nFbgwm%2fgeg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8A3ECA35468D617D8A647AE06FC2E0569CB8E536","accentColor":"434343"},"4192BE0EF5BA30963D17A25EE0C243518A668E19":{"name":"Ai mcqs - For a perfect binary tree of BFS resists the nodes in the ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.nLHRnAtupV3YMk2Dulm_vgHaKd?pid=Api","datePublished":"2024-05-26T09:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7a9d8947a38aa35bd90ed9c903c83e00/thumb_1200_1696.png","hostPageUrl":"https://www.studocu.com/in/document/srm-institute-of-science-and-technology/social-engineering/ai-mcqs/94100462","contentSize":"92116 B","width":1200,"height":1696,"cDNContentUrl":"https://th.bing.com/th/id/R.9cb1d19c0b6ea55dd8324d83ba59bfbe?rik=FCnr4F%2brA2nTcQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"91E866A815342C0EE52A71D36903AB5FE0EB2914","accentColor":"9C9C00"},"75701ABE528AA1BCCC847DB0BC50A8D27E3BA61A":{"name":"Construct a complete binary tree - util; import java.util; // A Binary ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.clvIl8-_lukcRqIyZSpeDgHaJl?pid=Api","datePublished":"2022-05-26T21:06:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/3d91df8af3ef65696a32cde683e8345c/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/kannur-university/java-programming/construct-a-complete-binary-tree/27334265","contentSize":"61964 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.725bc897cfbf96e91c46a232652a5e0e?rik=Vweh6yWoGsvMSA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A16AB3E72D8A05CB0BD748CCCB1AA825EBA10757","accentColor":"4D4D4D"},"844C9959AB22E56150A95ECEBACFD71193303CA5":{"name":"199. Binary Tree Right Side View - Medium | DSA Corner | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.cLdzLVWf0I1LWMSIFCwyRAHaD1?pid=Api","datePublished":"2025-04-20T17:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/binary-tree-right-side-view","contentSize":"13025 B","width":671,"height":348,"cDNContentUrl":"https://th.bing.com/th/id/R.70b7732d559fd08d4b58c488142c3244?rik=SMSZlboiXhYFmg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5AC30339117DFCABECE59A05165E22BA9599C448","accentColor":"343434"},"E98D9E81D1714C06714DDD5EACFDB85DF97CD056":{"name":"226. Invert Binary Tree - Easy | DSA Corner | Talentd","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.1qeWkhBAFPxbNmwt8i9_4wHaBx?pid=Api","datePublished":"2025-04-20T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/03/14/invert2-tree.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/invert-binary-tree","contentSize":"15045 B","width":761,"height":182,"cDNContentUrl":"https://th.bing.com/th/id/R.d6a79692104014fc5b366c2df22f7fe3?rik=ntjpGB0XxGAX1A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"650DC79FD58BDFCAE5DDD41760C4171D18E9D89E","accentColor":"517A7A"},"352617263408A166518F39615F231D69756D91DC":{"name":"111. Minimum Depth of Binary Tree - Easy | DSA Corner | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.IkAedKuHyR49PpaHoztArwAAAA?pid=Api","datePublished":"2025-04-20T17:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/minimum-depth-of-binary-tree","contentSize":"12800 B","width":432,"height":302,"cDNContentUrl":"https://th.bing.com/th/id/R.22401e74ab87c91e3d3e9687a33b40af?rik=U2JxYkOAGmYV%2bA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CD19D65796D132F51693F815661A804362716253","accentColor":"666666"},"EEA0A475E764FBFC3FD56F7E525E50FD6D190A22":{"name":"Master BFS & DFS: Essential Graph Algorithms Explained –Notes","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.isKhWw9TC1zIau0FKbnjdQHaEK?pid=Api","datePublished":"2025-07-08T19:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://notes.suhaib.in/images/featured/demystifying-binary-trees-a-hands-on-guide-25626507.jpg","hostPageUrl":"https://notes.suhaib.in/docs/code/graph/theory/graph-traversals---bfs--dfs/","contentSize":"60274 B","width":1880,"height":1058,"cDNContentUrl":"https://th.bing.com/th/id/R.8ac2a15b0f530b5cc86aed0529b9e375?rik=7gpKV35Gv8%2fzXQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"22A091D6DF05E525E7F65DF3CFBF467E574A0AEE","accentColor":"646766"},"7310743EBE2A7CA82E08A1B673F30D6F244F200C":{"name":"Strictly Binary Tree - Programming and Data Structures - Computer ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.RkHiGmyINlgtfoCO1H78AAHaI1?pid=Api","datePublished":"2022-11-27T01:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/1611931_8665d50f-1420-4bf9-b01a-eb773b21fdaa_lg.jpg","hostPageUrl":"https://edurev.in/t/248568/Strictly-Binary-Tree","contentSize":"15099 B","width":500,"height":596,"cDNContentUrl":"https://th.bing.com/th/id/R.4641e21a6c8836582d7e808ed47efc00?rik=NwFH4%2buix4rigA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C002F442F6D03F376B1A80E28AC7A2EBE3470137","accentColor":"181818"},"82AB871F583D16A72807448FA7C05B1A4EBBD95D":{"name":"4.4 Binary Search Tree","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.n4m08owNIY628yEggYOX4gAAAA?pid=Api","datePublished":"2018-11-07T01:15:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img167.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node91.html","contentSize":"4159 B","width":341,"height":629,"cDNContentUrl":"https://th.bing.com/th/id/R.9f89b4f28c0d218eb6f32120818397e2?rik=KLp48YXTYXqCcA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D59DBBE4A1B50C7AF84470827A61D385F178BA28","accentColor":"2F2F2F"},"957F5414BCFB05166413E3944C711BF8D279DE6D":{"name":"2096. Step-By-Step Directions From a Binary Tree Node to Another ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.zIl5hozJJXHvyjkxXr_hBQAAAA?pid=Api","datePublished":"2025-04-20T17:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/11/15/eg2.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/step-by-step-directions-from-a-binary-tree-node-to-another","contentSize":"4149 B","width":74,"height":102,"cDNContentUrl":"https://th.bing.com/th/id/R.cc8979868cc92571efca39315ebfe105?rik=WfdFQcu%2fUGFGMQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D6ED972D8FB117C4493E31466150BFCB4145F759","accentColor":"A40942"},"C553034E620E830445A38310184FB23A855163A1":{"name":"513. Find Bottom Left Tree Value - Medium | DSA Corner | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.HVzVk7SfgIpznNY656B26wAAAA?pid=Api","datePublished":"2025-03-07T14:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/find-bottom-left-tree-value","contentSize":"6825 B","width":302,"height":182,"cDNContentUrl":"https://th.bing.com/th/id/R.1d5cd593b49f808a739cd63ae7a076eb?rik=XDUw5CbgOEBUOg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1A361558A32BF48101383A544038E026E430355C","accentColor":"666666"},"0DB6A522935A7C5092E57044EE481578A6EB7F3D":{"name":"BFS-BREADTH FIRST SEARCH","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.cEX2DVjViCWk6LXxjJ6idQHaIe?pid=Api","datePublished":"2020-10-05T17:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode10.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm","contentSize":"107258 B","width":632,"height":723,"cDNContentUrl":"https://th.bing.com/th/id/R.7045f60d58d58825a4e8b5f18c9ea275?rik=0GtaIjmlxwUpXg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D3F7BE6A875184EE44075E2905C7A539225A6BD0","accentColor":"CAA301"},"8519077531F57B60EF519C0F778FB6E63AA6105E":{"name":"BFS for digraph while taking input from user - util; import java.util ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.rl9NvAXY0WVhMw7xxNdG5QHaJl?pid=Api","datePublished":"2024-08-03T21:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1ac4149a58dea90e4863214406f6c142/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-visvesvaraya-college-of-engineering/computer-science-and-engineering/bfs-for-digraph-while-taking-input-from-user/100520921","contentSize":"85612 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.ae5f4dbc05d8d16561330ef1c4d746e5?rik=WJFwVxNftwb%2bFQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E5016AA36E6BF877F0C915FE06B75F1357709158","accentColor":"666666"},"C3D9CE07ADD4B990F1D1D0CA12B2DF7F0A68E487":{"name":"Operators in Java - Java Tutorial","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.sO8Laqcdi7FYgI9dgsmAegHaEK?pid=Api","datePublished":"2015-06-10T02:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.sitesbay.com/java/images/basic-java/operator-java.png","hostPageUrl":"https://www.sitesbay.com/java/operators-in-java","contentSize":"6480 B","width":561,"height":315,"cDNContentUrl":"https://th.bing.com/th/id/R.b0ef0b6aa71d8bb158808f5d82c9807a?rik=PJ3scNpNmwkfHQ&pid=ImgRaw&r=0","isTransparent":true,"imageId":"784E86A0F7FD2B21AC0D1D1F099B4DDA70EC9D3C","accentColor":"364895"},"9ABE15E8E4EF421012EC15009A5CDF80309B18B3":{"name":"III ECE DS 11, 13 programs - 11. Write Java programs for the ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.h_hrs98B6RDIaaK4aJbSkgHaJl?pid=Api","datePublished":"2023-03-08T08:38:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/04240ce0fe443c8f2afa4a6fac171bee/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/vignans-foundation-for-science-technology-and-research/basics-of-electrical-and-electronics-engineering/iii-ece-ds-11-13-programs/39628284","contentSize":"191617 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.87f86bb3df01e910c869a2b86896d292?rik=qetRjk7%2bJAEhzg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3B81B90308FDC5A90051CE210124FE4E8E51EBA9","accentColor":"4B4849"},"37B125A38F259CA089025AE057FCBB85ADA250D3":{"name":"Breadth First Search - Bfs structure - Breadth First Search The only ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.UzmdLGbiUaE7SODg9uQqnAHaJl?pid=Api","datePublished":"2023-06-13T03:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/476ffa13865835370423d560050c4765/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-calicut/artificial-intelligence/breadth-first-search-bfs-structure/46009211","contentSize":"297282 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.53399d2c66e251a13b48e0e0f6e42a9c?rik=cxtSOvhSyQqYIA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3D052ADA58BBCF750EA520980AC952F83A521B73","accentColor":"078D07"},"F9C3CAAF933D761B2AA8AF8EE2C909E56E4F7AB5":{"name":"Programming in C: IIIT PGEE 2019","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.hLC9djANvZ_DXZMg3UKW0AHaDw?pid=Api","datePublished":"2019-04-28T23:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.gatevidyalay.com/wp-content/uploads/2018/07/Skewed-Binary-Tree-Example.png","hostPageUrl":"https://gateoverflow.in/310938/iiit-pgee-2019","contentSize":"8671 B","width":542,"height":275,"cDNContentUrl":"https://th.bing.com/th/id/R.84b0bd76300dbd9fc35d9320dd4296d0?rik=nzys%2bjnTZ7Giig&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5BA7F4E65E909C2EE8FA8AA2B167D339FAAC3C9F","accentColor":"CC6600"},"60B0B8103C787FC520C293CC7A52E65B44C2EB9C":{"name":"TREE TRAVERSAL CODE","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.303xHOWvaCXi7NhT3yVMqgHaD6?pid=Api","datePublished":"2020-10-12T02:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/TreeTraversalCode1.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Tree-Traversal-Code.htm","contentSize":"111931 B","width":1241,"height":657,"cDNContentUrl":"https://th.bing.com/th/id/R.df4df11ce5af6825e2ecd853df254caa?rik=BguLAcOH91wCLA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C9BE2C44B56E25A7CC392C025CF787C3018B0B06","accentColor":"C63A05"},"419134C63EE5D74C4226F16891AA3EED6F074EFB":{"name":"8.2.1 Breadth-first search of undirected graph","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.wBAUecpF5W5C0rH1GaR0BAHaGc?pid=Api","datePublished":"2020-08-15T19:55:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gtl.csa.iisc.ac.in/dsa/img415.gif","hostPageUrl":"https://gtl.csa.iisc.ac.in/dsa/node180.html","contentSize":"5128 B","width":690,"height":600,"cDNContentUrl":"https://th.bing.com/th/id/R.c0101479ca45e56e42d2b1f519a47404?rik=FBlDbONefcQkYg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"BFE470F6DEE3AA19861F6224C47D5EE36C431914","accentColor":"2C2C2C"},"C25E0E995AE8CF1C282CC623BA1D45DCF64141A2":{"name":"687. Longest Univalue Path - Medium | DSA Corner | Talentd","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.VYjBPJazUIGHDtfOmB_y4AHaD6?pid=Api","datePublished":"2025-03-06T03:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/longest-univalue-path","contentSize":"15233 B","width":571,"height":302,"cDNContentUrl":"https://th.bing.com/th/id/R.5588c13c96b35081870ed7ce981ff2e0?rik=LOXgmaWO%2fMGCwg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2A14146FCD54D1AB326CC282C1FC8EA599E0E52C","accentColor":"326699"},"3EBFB0D5BB1F872EE0D4B32B0AC9FAAD986EA484":{"name":"Find Duplicate Subtrees - DSA Problem | Talentd","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.gYBJkHRa8aiSyCZ84gZL-gHaF0?pid=Api","datePublished":"2025-04-26T01:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/08/16/e1.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/find-duplicate-subtrees","contentSize":"19885 B","width":561,"height":441,"cDNContentUrl":"https://th.bing.com/th/id/R.81804990745af1a892c8267ce2064bfa?rik=4%2fsLXbvxeOIOTQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"484AE689DAAF9CA0B23B4D0EE278F1BB5D0BFBE3","accentColor":"436688"},"9E4110B1619E42FAE25B7044EE481578A6EB7F3D":{"name":"BFS-BREADTH FIRST SEARCH","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.IENg8ogEp_77vrgIJvbZigHaIh?pid=Api","datePublished":"2020-10-05T17:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode4.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm","contentSize":"95807 B","width":627,"height":722,"cDNContentUrl":"https://th.bing.com/th/id/R.204360f28804a7fefbbeb80826f6d98a?rik=6RQBGxbpJK8utQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D3F7BE6A875184EE4407B52EAF24E9161B0114E9","accentColor":"02B651"},"22F8E8493F35F4ED59B2670F401CDAC77A0F6FD8":{"name":"Ashwani Blog","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.o23dagqqzSzesNJjospgVgHaEH?pid=Api","datePublished":"2022-08-30T22:25:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://media.geeksforgeeks.org/wp-content/uploads/20220309171621/BinarySearch.png","hostPageUrl":"https://blog.ashwanikumarsingh.in/blogposts/binary-search","contentSize":"179900 B","width":720,"height":401,"cDNContentUrl":"https://th.bing.com/th/id/R.a36ddd6a0aaacd2cdeb0d263a2ca6056?rik=Io%2bOlPNTT96VKw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"8DF6F0A77CADC104F0762B95DE4F53F3948E8F22","accentColor":"92B516"},"E61C698713BCFC1BDBAFF938735C3CC00A7CBFF5":{"name":"BINARY SEARCH","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.VrXhOCdcCLiHZjXyLnFF1AHaCO?pid=Api","datePublished":"2020-08-04T08:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinarySearching2.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search.htm","contentSize":"11539 B","width":674,"height":203,"cDNContentUrl":"https://th.bing.com/th/id/R.56b5e138275c08b8876635f22e7145d4?rik=bsGWeDHLz7G9%2bg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FFBC7A00CC3C537839FFABDB1CFCB317896C16E","accentColor":"4B1303"},"0BCE0540962E75870FC9FDA43A27E95DDCE5D60F":{"name":"Minimum Number of Operations to Sort a Binary Tree by Level - DSA ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.AlApj3cegASxgBReu67ErAHaFE?pid=Api","datePublished":"2025-04-22T10:57:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2022/09/18/image-20220918174052-4.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/minimum-number-of-operations-to-sort-a-binary-tree-by-level","contentSize":"29765 B","width":708,"height":485,"cDNContentUrl":"https://th.bing.com/th/id/R.0250298f771e8004b180145ebbaec4ac?rik=sOxQBGniV3jwnA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F06D5ECDD59E72A34ADF9CF07857E2690450ECB0","accentColor":"5A6A71"},"EB63794CD1190F67A460B32B0AC9FAAD986EA484":{"name":"Find Duplicate Subtrees - DSA Problem | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.b4ara5edbd4JmXiQxZxEXAHaE_?pid=Api","datePublished":"2025-04-26T01:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/08/16/e33.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/find-duplicate-subtrees","contentSize":"25798 B","width":589,"height":397,"cDNContentUrl":"https://th.bing.com/th/id/R.6f86ab6b979d6dde09997890c59c445c?rik=vjaXxB2R8HZKBg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"484AE689DAAF9CA0B23B064A76F0911DC49736BE","accentColor":"7E534D"},"01752C38D8222ED3A267021739A3B2A3D477C471":{"name":"DSA Binary Search Tree(BST) - Binary Search Tree(BST) Binary search ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.2TRF0dP7TedIDPuTdP0jlwHaKe?pid=Api","datePublished":"2021-07-21T23:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/af643efbf6e89b8128a55ea337978c62/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/anna-university/computer-science/dsa-binary-search-treebst/9057467","contentSize":"517145 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.d93445d1d3fb4de7480cfb9374fd2397?rik=EFfCg40i4j0qdg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"174C774D3A2B3A937120762A3DE2228D83C25710","accentColor":"0B73C0"},"884CB9E9151045E4BB0D09DBA30BE3E1BA1C8B1D":{"name":"Depth-first and breadth-first search in Haskell","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.O0Ece5lWJWt1AKpuuGG3gAAAAA?pid=Api","datePublished":"2021-04-19T02:29:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://malv.in/images/xkcd-2407-depth_and_breadth.png","hostPageUrl":"https://malv.in/posts/2021-01-09-depth-first-and-breadth-first-search-in-haskell.html","contentSize":"79514 B","width":350,"height":449,"cDNContentUrl":"https://th.bing.com/th/id/R.3b411c7b9956256b7500aa6eb861b780?rik=iMSbnlEBVE670A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D1B8C1AB1E3EB03ABD90D0BB4E5401519E9BC488","accentColor":"363636"},"BB6D1BCB65F77C5A6EAD06C3B265F821E2248D67":{"name":"AVL Trees - Definition, Theorem, Algorithm with Example C Programs ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.FLCBF_ry3-G5tlsh4YK2ZgHaCl?pid=Api","datePublished":"2023-08-01T22:03:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.poriyaan.in/media/imgPori/images51/PKfRgrd.jpg","hostPageUrl":"https://cse.poriyaan.in/topic/avl-trees-50539/","contentSize":"44062 B","width":613,"height":214,"cDNContentUrl":"https://th.bing.com/th/id/R.14b08117faf2dfe1b9b65b21e182b666?rik=u9axvFZ%2fx6Xm2g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"76D8422E128F562B3C60DAE6A5C77F56BCB1D6BB","accentColor":"60636B"},"753D2482EDB63F1EAAC97A8D223097F618DC436A":{"name":"Algorithms: introduction to algorithms Thomas H.cormen q.22.2-3","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.5o8J6mL1OUaPb2qQvC4nIAHaEb?pid=Api","datePublished":"2017-10-19T13:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://gateoverflow.in/?qa=blob&qa_blobid=17871884588635617206","hostPageUrl":"https://gateoverflow.in/82109/introduction-to-algorithms-thomas-h-cormen-q-22-2-3","contentSize":"25592 B","width":600,"height":359,"cDNContentUrl":"https://th.bing.com/th/id/R.e68f09ea62f539468f6f6a90bc2e2720?rik=V9NCKN5r8%2bGqnA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A634CD816F790322D8A79CAAE1F36BDE2842D357","accentColor":"70695B"},"72727DC64E89012DDE97E81ABD6247C88AEB2437":{"name":"Chapter 5 -- Exception Handling in Java","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.IHQKwk6X90sf7bZhNUARhgAAAA?pid=Api","datePublished":"2019-07-30T01:42:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://cse.iitkgp.ac.in/~dsamanta/java/exception1.jpg","hostPageUrl":"https://cse.iitkgp.ac.in/~dsamanta/java/ch5.htm","contentSize":"21294 B","width":453,"height":227,"cDNContentUrl":"https://th.bing.com/th/id/R.20740ac24e97f74b1fedb66135401186?rik=JyfXbOSYENLteQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7342BEA88C7426DBA18E79EDD21098E46CD72727","accentColor":"796A52"},"672E50E19F5280F0817B42323D46A7BF50EC3461":{"name":"Binary Tree Tilt - DSA Problem | Talentd","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.lfib3ZoTPTRyWgMwFJNwWQHaEL?pid=Api","datePublished":"2025-04-20T17:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://backend.talentd.in/wp-content/uploads/dsa/dsa-corner-binary-tree-tilt.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/binary-tree-tilt","contentSize":"92709 B","width":1640,"height":924,"cDNContentUrl":"https://th.bing.com/th/id/R.95f89bdd9a133d34725a033014937059?rik=duIFHvklCA8Ytw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1643CE05FB7A64D32324B7180F0825F91E05E276","accentColor":"24A75B"},"025BFF133DEF15C91C3E55D85FA7F925F122133C":{"name":"AVL TREE - good - THREADED BINARY TREEs A threaded binary tree is the ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.nk1dXXdVqyoWbQaWqjwviQHaKe?pid=Api","datePublished":"2023-02-20T09:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/f6d979415ab06ed6aa8769a817d3824d/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/university-of-madras/advance-java/avl-tree-good/40658520","contentSize":"469559 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.9e4d5d5d7755ab2a166d0696aa3c2f89?rik=ILX%2fMdP%2bUZzB4w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C331221F529F7AF58D55E3C19C51FED331FFB520","accentColor":"5B6570"},"D367A2E2C877B2F0BBF77A9A9CF92BA35F5C3F0B":{"name":"Delete Node In Binary Search Tree -C#","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.41O4q2o5mVSBn1PbBma-2gHaFE?pid=Api","datePublished":"2021-06-05T11:14:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://1.bp.blogspot.com/-K2iXLnj6AnA/YLhtRapJ0ZI/AAAAAAAAOvI/YEOzeRc2KrwhQ241x_xWx-RL37uHP9mfACLcBGAsYHQ/w1600/no_c.gif","hostPageUrl":"https://www.codeguru.co.in/2021/06/delete-node-in-binary-search-tree-c.html","contentSize":"25265 B","width":1054,"height":722,"proxyContentUrl":"https://tse1.mm.bing.net/th/id/OGC.e353b8ab6a399954819f53db0666beda?pid=Api&rurl=https%3a%2f%2f1.bp.blogspot.com%2f-K2iXLnj6AnA%2fYLhtRapJ0ZI%2fAAAAAAAAOvI%2fYEOzeRc2KrwhQ241x_xWx-RL37uHP9mfACLcBGAsYHQ%2fw1600%2fno_c.gif&ehk=piegWbUV28PJZk8CeGD16Xq3LbYiKEBkizcoN9Liy%2f8%3d","cDNContentUrl":"https://th.bing.com/th/id/R.e353b8ab6a399954819f53db0666beda?rik=PXYqLox3Kw%2b7fw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B0F3C5F53AB29FC9A9A77FBB0F2B778C2E2A763D","accentColor":"8D271F"},"9A255B9143BAF1AF38B3FA1A0809F0EF898A8269":{"name":"Univalued Binary Tree - DSA Problem | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.UimrGJlLbqiHal1u91PLFAAAAA?pid=Api","datePublished":"2025-04-21T18:39:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2018/12/28/unival_bst_1.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/univalued-binary-tree","contentSize":"6961 B","width":265,"height":172,"cDNContentUrl":"https://th.bing.com/th/id/R.5229ab18994b6ea8876a5d6ef753cb14?rik=qVK1GTSrH%2fqDOw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9628A898FE0F9080A1AF3B83FA1FAB3419B552A9","accentColor":"516D7A"},"C8959E7357A8B1ED59FD1B7122853C644B768EE7":{"name":"Дерево Меркла — Teletype","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.PBvfjS0XJeWAjjBXfiE16gHaDt?pid=Api","datePublished":"2022-11-08T21:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://media.geeksforgeeks.org/wp-content/cdn-uploads/MerkleTree-min-1024x512.png","hostPageUrl":"https://teletype.in/@ortomich/Merkle_Tree","contentSize":"192691 B","width":1024,"height":512,"cDNContentUrl":"https://th.bing.com/th/id/R.3c1bdf8d2d1725e5808e30577e2135ea?rik=jFnpN3WKG96V3w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"7EE867B446C3582217B1DF95DE1B8A7537E9598C","accentColor":"379442"},"CD9C9578DD39A79E521A4AE401C9EA11358ABD51":{"name":"515. Find Largest Value in Each Tree Row - Medium | DSA Corner | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.L9NEV087NnT5kQA3tAUd-QHaEP?pid=Api","datePublished":"2025-03-07T14:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/find-largest-value-in-each-tree-row","contentSize":"18493 B","width":562,"height":322,"cDNContentUrl":"https://th.bing.com/th/id/R.2fd344574f3b3674f9910037b4051df9?rik=3MlZh92TeukloQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"15DBA85311AE9C104EA4A125E97A93DD8759C9DC","accentColor":"41608A"},"CC67BC6A87320BD49F0C61D0CD8026564AAC8590":{"name":"U2 multiplication near base - Programming in java - Studocu","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.rzkmZE_WxZR_vwZRJuwUswHaPK?pid=Api","datePublished":"2021-05-02T04:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/028d2b52e19fc3e4b04e6fa87a0f3c27/thumb_1200_2457.png","hostPageUrl":"https://www.studocu.com/in/document/lovely-professional-university/programming-in-java/u2-multiplication-near-base/12130855","contentSize":"590241 B","width":1200,"height":2457,"cDNContentUrl":"https://th.bing.com/th/id/R.af3926644fd6c5947fbf065126ec14b3?rik=zHbLpngjsE35wA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0958CAA4656208DC0D16C0F94DB02378A6CB76CC","accentColor":"202020"},"196BB02DF80D82D69DA0AE45072094EB2392841A":{"name":"Second Minimum Node In a Binary Tree - DSA Problem | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.52ZQuScygrzGY5eVNJLlDQAAAA?pid=Api","datePublished":"2025-04-22T02:57:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/10/15/smbt2.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/second-minimum-node-in-a-binary-tree","contentSize":"7145 B","width":321,"height":182,"cDNContentUrl":"https://th.bing.com/th/id/R.e76650b9273282bcc66397953492e50d?rik=kbYL0o%2fQKG3ZCg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A1482932BE49027054EA0AD96D28D08FD20BB691","accentColor":"666666"},"6FDC17D7E7511F5EA77D603AEAA29053388C2DD0":{"name":"Binary Code Presentation Years 3-6 Digital Technologies","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.8ckHBI4LrRMZnmqdkXpBGgHaDt?pid=Api","datePublished":"2022-07-08T18:42:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/b1/5e/au-st-1652355336-binary-code-presentation-years-3-6_ver_1.png","hostPageUrl":"https://www.twinkl.co.in/resource/binary-code-powerpoint-3-6-au-st-1652355336","contentSize":"70838 B","width":630,"height":315,"cDNContentUrl":"https://th.bing.com/th/id/R.f1c907048e0bad13199e6a9d917a411a?rik=9s1xfX4V8eV61w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"0DD2C88335092AAEA306D77AE5F1157E7D71CDF6","accentColor":"038FC8"},"6149ACF2BDB28BEAB73E9558DC4FF6F2C363E7D2":{"name":"1080. Insufficient Nodes in Root to Leaf Paths - Medium | DSA Corner ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.-57MCmUp4qdieYXxYyeyMgHaFE?pid=Api","datePublished":"2025-03-16T05:20:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2019/06/05/insufficient-3.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/insufficient-nodes-in-root-to-leaf-paths","contentSize":"55096 B","width":706,"height":484,"cDNContentUrl":"https://th.bing.com/th/id/R.fb9ecc0a6529e2a7627985f16327b232?rik=FpTKL9sruK574w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2D7E363C2F6FF4CD8559E37BAEB82BDB2FCA9416","accentColor":"448888"},"4D916B1E3E7EA8A4072DEB19F27153D1010770DC":{"name":"Binary tree traversals - Data Structures Tutorial | Study Glance","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.WobjAZiEmpNN-8JhldmzJgHaCx?pid=Api","datePublished":"2023-11-19T16:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://studyglance.in/images/logo4.png","hostPageUrl":"https://studyglance.in/ds/display.php?tno=24&topic=Binary-tree-traversals","contentSize":"162211 B","width":2559,"height":960,"cDNContentUrl":"https://th.bing.com/th/id/R.5a86e30198849a934dfbc26195d9b326?rik=1Bm24ePnikpw0g&pid=ImgRaw&r=0","isTransparent":true,"imageId":"CD0770101D35172F91BED2704A8AE7E3E1B619D4","accentColor":"C78404"},"34D7ECB9F3625DE1AE12A41179E913C98DE54021":{"name":"968. Binary Tree Cameras - Hard | DSA Corner | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.nshFqbssf3PLNIiVO1bKygAAAA?pid=Api","datePublished":"2025-04-20T17:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_01.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/binary-tree-cameras","contentSize":"7426 B","width":138,"height":163,"cDNContentUrl":"https://th.bing.com/th/id/R.9ec845a9bb2c7f73cb3488953b56caca?rik=Q33Omz8m1R7qIQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"12045ED89C319E97114A21EA1ED5263F9BCE7D43","accentColor":"448888"},"5C3B16518DED9AC73A20A41179E913C98DE54021":{"name":"968. Binary Tree Cameras - Hard | DSA Corner | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.7Rk0MOyKeyBHVxzO11ZcSgAAAA?pid=Api","datePublished":"2025-04-20T17:58:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_02.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/binary-tree-cameras","contentSize":"10614 B","width":139,"height":312,"cDNContentUrl":"https://th.bing.com/th/id/R.ed193430ec8a7b2047571cced7565c4a?rik=xbNhFdjeqXyjAg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"12045ED89C319E97114A02A37CA9DED81561B3C5","accentColor":"444488"},"57F9CFFAFFD873F07A71E3903406E81864533A82":{"name":"Sum of Nodes with Even-Valued Grandparent - DSA Problem | Talentd","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.1og99H2yt0fdUvsAdxK2DQHaEc?pid=Api","datePublished":"2025-04-25T21:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/08/10/even1-tree.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/sum-of-nodes-with-even-valued-grandparent","contentSize":"26307 B","width":504,"height":302,"cDNContentUrl":"https://th.bing.com/th/id/R.d6883df47db2b747dd52fb007712b60d?rik=dZ%2f8r%2f%2bNNw%2bnFw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"28A33546818E6043093E17A70F378DFFAFFC9F75","accentColor":"0044CB"},"7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20":{"name":"Searching Strategies : Breadth First Search","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?pid=Api","datePublished":"2020-12-12T18:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg","hostPageUrl":"https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai","contentSize":"179039 B","width":1240,"height":1754,"cDNContentUrl":"https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7","accentColor":"434343"},"55682BE16F5FC52AC402E531A36444706D5CB333":{"name":"In the binary equation ( 1p101)2+ (10q1)2= (100r100)2Where p, q and r ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.jt9Gx7fip2khCpfAWhafvgAAAA?pid=Api","datePublished":"2024-03-12T04:47:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/6008e824-b275-4acc-87a2-5ce234d86ddd_lg.png","hostPageUrl":"https://edurev.in/question/4600031/In-the-binary-equation---1p101-2--10q1-2--100r100-2Where-p--q-and-r-are-binary-digits--what-are-the-","contentSize":"4152 B","width":245,"height":210,"cDNContentUrl":"https://th.bing.com/th/id/R.8edf46c7b7e2a769210a97c05a169fbe?rik=VYayHvb1XKJMIA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"333BC5D60744463A135E204CA25CF5F61EB28655","accentColor":"666666"},"B51533DA68AC2C0A1AF45141F37A6D85546629B9":{"name":"Binary Search Algorithm Example in Java | DSA","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.ENm0nzS9UMxdwsEgIOxnJgHaCs?pid=Api","datePublished":"2025-08-30T13:13:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://smartprogramming.in/tutorials/dsa-using-java/images/binary-search-algorithm-in-java-dsa.jpg","hostPageUrl":"https://smartprogramming.in/tutorials/dsa-using-java/binary-search-algorithm-example","contentSize":"144864 B","width":1622,"height":590,"cDNContentUrl":"https://th.bing.com/th/id/R.10d9b49f34bd50cc5dc2c12020ec6726?rik=W1EzrYbKwqChTw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9B92664558D6A73F14154FA1A0C2CA86AD33515B","accentColor":"AA2121"},"B8BEFFCF29FD8A9107C05DD90DCCC5A9397DD092":{"name":"A Search Algorithm Puzzle: Finding a Bad Coin - /usr/sbin/blog","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.HdLmnlx3R-70SONnUFLOXgHaFk?pid=Api","datePublished":"2025-03-28T22:30:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://media.usrsb.in/bad-coin/dectree.png","hostPageUrl":"https://www.usrsb.in/blog/blog/2011/08/17/a-search-algorithm-puzzle-finding-a-bad-coin/","contentSize":"48520 B","width":1366,"height":1026,"cDNContentUrl":"https://th.bing.com/th/id/R.1dd2e69e5c7747eef448e3675052ce5e?rik=i%2bv%2f%2fJLfqBlwDA&riu=http%3a%2f%2fmedia.usrsb.in%2fbad-coin%2fdectree.png&ehk=qfvwbOk4SGLQ%2ffelz%2bprqJ6ln7Uzsj1MGXfu6pPgLQ8%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"290DD7939A5CCCD09DD50C7019A8DF92FCFFEB8B","accentColor":"202020"},"BE2A2EBD8924B6B5B62D913BE1A3A03D6CA881B1":{"name":"Multi-Level Knowledge-Aware Contrastive Learning Network for ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.Gqp8kuKxCkU8Wxkqu8oTEwHaDL?pid=Api","datePublished":"2022-12-14T15:30:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://pub.mdpi-res.com/applsci/applsci-12-12863/article_deploy/html/images/applsci-12-12863-g001.png?1671536891","hostPageUrl":"https://www.mdpi.com/2076-3417/12/24/12863","contentSize":"1146278 B","width":3974,"height":1706,"cDNContentUrl":"https://th.bing.com/th/id/R.1aaa7c92e2b10a453c5b192abbca1313?rik=66Li25hCa1tr0g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"1B188AC6D30A3A1EB319D26B5B6B4298DBE2A2EB","accentColor":"B49017"},"0FF21CDBBC095794CCA01F2426EF91AA669DAA0A":{"name":"Quick Sort | Ujjwalit","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.XrsVSTkt6I9XDvvK4JuQeQHaDt?pid=Api","datePublished":"2025-04-29T09:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://media.geeksforgeeks.org/wp-content/uploads/20240926172924/Heap-Sort-Recursive-Illustration.webp","hostPageUrl":"https://www.ujjwalit.co.in/blogs/6803ca6eed98f38ab4d56803","contentSize":"22980 B","width":801,"height":401,"cDNContentUrl":"https://th.bing.com/th/id/R.5ebb1549392de88f570efbcae09b9079?rik=8C%2fBvcuQdUnMCg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A0AAD966AA19FE6242F10ACC497590CBBDC12FF0","accentColor":"4E7D6E"},"F77C61B884B410F6F9FDC4B31FF470AF16C4530E":{"name":"Object-Oriented Programming (OOP) with Java - ② ♠r r s ♥ r s ② ♣♦ ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.GQ3mqSFFPVI75UC-c1AOEgHaJl?pid=Api","datePublished":"2023-06-18T23:21:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/9db96e980fc2b15e81427bdafb17e9a5/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/adithya-institute-of-technology/computer-networks/object-oriented-programming-oop-with-java/55008871","contentSize":"265087 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.190de6a921453d523be540be73500e12?rik=f8cWi0hLAW%2bf3w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"E0354C61FA074FF13B4CDF9F6F014B488B16C77F","accentColor":"424242"},"8F058530F8FD0CA802F1CEE50B12E275ED774EAC":{"name":"SATHEE: Chapter 04 Forest Society and Colonialism","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.V4VawYg-jKslXXWUKLYITAHaER?pid=Api","datePublished":"2025-06-23T11:40:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://temp-public-img-folder.s3.amazonaws.com/sathee.prutor.images/sathee_image/https___cdn_mathpix_com_cropped_2024_01_22_ed21c933942a98e4e90dg-457_jpg_height_626_width_1086_top_left_y_1815_top_left_x_89.jpg","hostPageUrl":"https://sathee.iitk.ac.in/ncert-books/class-09/social-science/india-and-the-contemporary-world-1/chapter-04-forest-society-and-colonialism/","contentSize":"112491 B","width":1086,"height":626,"cDNContentUrl":"https://th.bing.com/th/id/R.57855ac1883e8cab255d759428b6084c?rik=%2bFBYA4%2ffwIogHw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"CAE477DE572E21B05EEC1F208AC0DF8F035850F8","accentColor":"575456"},"3F57A06A98E99A50EF542AA7FEB46C6A8E3A6234":{"name":"PRIM's ALGORITHM - MINIMUM SPANNING TREE - IMPLEMENTATION","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.-g8WnINqpJvmy6zpuaSo8QHaIK?pid=Api","datePublished":"2020-09-17T18:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/PrimsImplementation11.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Prim's-Algorithm-Minimum-Spanning-Tree-Implementation.htm","contentSize":"76448 B","width":660,"height":727,"cDNContentUrl":"https://th.bing.com/th/id/R.fa0f169c836aa49be6cbace9b9a4a8f1?rik=83UKpomeqQX%2bRQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4326A3E8A6C64BEF7AA245FE05A99E89A60A75F3","accentColor":"C63A05"},"C5B577A6C6DA2927573F56A4887CA003ADFF2CA2":{"name":"How to Use Trees","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.kf6KK-3qfn2UiP5VahrofgHaDy?pid=Api","datePublished":"2019-11-23T05:46:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.iitk.ac.in/esc101/05Aug/tutorial/figures/uiswing/components/TreeDemo.gif","hostPageUrl":"https://www.iitk.ac.in/esc101/05Aug/tutorial/uiswing/components/tree.html","contentSize":"6920 B","width":511,"height":261,"cDNContentUrl":"https://th.bing.com/th/id/R.91fe8a2bedea7e7d9488fe556a1ae87e?rik=XFt3amytknJ18w&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2AC2FFDA300AC7884A65F3757292AD6C6A775B5C","accentColor":"495382"},"222C10D28A31437CFB32A9FE3C7F2D0DB6BA2D69":{"name":"100. Same Tree - Easy | DSA Corner | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.iwaGnMRM3NQdP6m_GkJIfgAAAA?pid=Api","datePublished":"2025-03-09T07:52:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/same-tree","contentSize":"8285 B","width":382,"height":182,"cDNContentUrl":"https://th.bing.com/th/id/R.8b06869cc44cdcd41d3fa9bf1a42487e?rik=IsIBLagTNMe%2fIw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"96D2AB6BD0D2F7C3EF9A23BFC73413A82D01C222","accentColor":"666666"},"59ED5DA39C6259E504D98715CE7909B4250E04F2":{"name":"Kami Export - PCT2 Revision List - 1 Motion, forces and energy You ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.sdC-oOrhUxQ2xKQQAUJomwHaFP?pid=Api","datePublished":"2024-07-28T16:23:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/5008ab76f7cdfd0763d1af2697165fec/thumb_1200_849.png","hostPageUrl":"https://www.studocu.com/in/document/puducherry-technological-university/data-structures/kami-export-pct2-revision-list/94473781","contentSize":"159549 B","width":1200,"height":849,"cDNContentUrl":"https://th.bing.com/th/id/R.b1d0bea0eae1531436c4a4100142689b?rik=ld7VOskmlV5AnQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"2F40E0524B9097EC51789D405E9526C93AD5DE95","accentColor":"C98E02"},"443A04A9DE274E6139AD7C8AE3444F777675669A":{"name":"Binary Search Tree | Web Technology Experts Notes","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.6M3pfgxzvv_IDJN7l1z_oAAAAA?pid=Api","datePublished":"2018-01-03T13:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://4.bp.blogspot.com/-mKEkbylYkts/UamQnu5Y4aI/AAAAAAAAAJg/vqfrXF63oiA/s1600/Binary+Tree+Logo.png","hostPageUrl":"https://www.web-technology-experts-notes.in/2013/06/binary-search-tree.html","contentSize":"9594 B","width":201,"height":171,"cDNContentUrl":"https://th.bing.com/th/id/R.e8cde97e0c73beffc80c937b975cffa0?rik=RKNAmu1y5BaT2g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"A966576777F4443EA8C7DA9316E472ED9A40A344","accentColor":"666666"},"96C8DEB4BFD487EAF2C3DBBE055395D6B3CFEAD3":{"name":"Linear Search","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.CNzxpzJp7LVOyvrClw1bxgHaEK?pid=Api","datePublished":"2021-03-21T21:27:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://1.bp.blogspot.com/-2IH36gRCTVI/YFcpvnOcHJI/AAAAAAAALvk/ieJ-gZYh6hYMxvRDbiCsuv2655mGOF5uQCNcBGAsYHQ/w1600/linearSearch.png","hostPageUrl":"https://www.codeamy.in/2021/03/linear-search.html","contentSize":"96502 B","width":1600,"height":900,"cDNContentUrl":"https://th.bing.com/th/id/R.08dcf1a73269ecb54ecafac2970d5bc6?rik=aYztS%2ftNeK4vPA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3DAEFC3B6D593550EBBD3C2FAE784DFB4BED8C69","accentColor":"088849"},"0CAD8E4CEF8445CA18DCE3903406E81864533A82":{"name":"Sum of Nodes with Even-Valued Grandparent - DSA Problem | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.GEiBb5EmhmuBA-alzeXyfwAAAA?pid=Api","datePublished":"2025-04-25T21:48:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/08/10/even2-tree.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/sum-of-nodes-with-even-valued-grandparent","contentSize":"2332 B","width":64,"height":65,"cDNContentUrl":"https://th.bing.com/th/id/R.1848816f9126866b8103e6a5cde5f27f?rik=wNroxP5IVKyBzQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"28A33546818E6043093ECD81AC5448FEC4E8DAC0","accentColor":"666666"},"03E93CC98F85317A24FD3E6BCE007213E2B0970F":{"name":"JAVA – Innovative Codes Academy","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.QvpDijXb48OWzbZhfflKCwHaE8?pid=Api","datePublished":"2022-08-14T13:45:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://www.innovativecodesacademy.in/wp-content/uploads/2021/02/239302-1600x1067-mighty-oak-1536x1024.jpg","hostPageUrl":"http://www.innovativecodesacademy.in/java/","contentSize":"398706 B","width":1536,"height":1024,"cDNContentUrl":"https://th.bing.com/th/id/R.42fa438a35dbe3c396cdb6617df94a0b?rik=MJ7DnPhYE6dC3w&riu=http%3a%2f%2fwww.innovativecodesacademy.in%2fwp-content%2fuploads%2f2021%2f02%2f239302-1600x1067-mighty-oak-1536x1024.jpg&ehk=mgHGqtfTUheu41HUD%2f2QclysEuDEfOVNbjyqOcs354Q%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"F0790B2E312700ECB6E3DF42A71358F89CC39E30","accentColor":"3D3A1A"},"CB6CB635091D5F746021263B4F9142DD26AE9C32":{"name":"The ML Hub","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.i90O27gOluY4xpJA879ukQHaEK?pid=Api","datePublished":"2024-05-20T12:06:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://appxcontent.kaxa.in/paid_course3/2024-06-12-0.7196540566182834.png","hostPageUrl":"https://web.ravindrababuravula.in/new-courses/28-dsa-in-python","contentSize":"901268 B","width":1280,"height":720,"cDNContentUrl":"https://th.bing.com/th/id/R.8bdd0edbb80e96e638c69240f3bf6e91?rik=vMZrU5DR9UcGEg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"23C9EA62DD2419F4B362120647F5D190536BC6BC","accentColor":"CCC100"},"B2820A63DF56541B7AC1083BB6C9C0960432EF67":{"name":"DANIEL YARDS Blue Java Banana Seeds - 100pcs - Sweet & Nutritious India ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.PEdVPvmJ9sudpGdL8i0FlwHaHa?pid=Api","datePublished":"2023-07-29T20:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://images-cdn.ubuy.co.in/647b3de35c8d5c532d18273a-blue-java-banana-seeds-100pcs-the-ice.jpg","hostPageUrl":"https://www.ubuy.co.in/product/4SY6965CG-blue-java-banana-seeds-100pcs-the-ice-cream-banana-tree-plant-sweet-high-nutrition-fruit-seeds","contentSize":"77222 B","width":750,"height":750,"cDNContentUrl":"https://th.bing.com/th/id/R.3c47553ef989f6cb9da4674bf22d0597?rik=KyigNv1lRbGnHA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"76FE2340690C9C6BB3801CA7B14565FD36A0282B","accentColor":"2F8D9C"},"1FF5F956DE66B7E30833F46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.6VBqX5R3Z1E2BzmxHeerkgAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Sujal.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"15826 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.e9506a5f94776751360739b11de7ab92?rik=8V%2bfZe1mez6AMw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064F33803E7B66ED659F5FF1","accentColor":"9C2F43"},"EE6625C2A397ACD69068C6506EFFB7A698A6CDC9":{"name":"Java Downloads - Tools and Resources | Oracle India","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.uyelsTMOtnIzo2UQgi5HCwHaEE?pid=Api","datePublished":"2022-10-31T19:30:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oracle.com/a/tech/img/rc10-java-badge-3.png","hostPageUrl":"https://www.oracle.com/in/java/technologies/downloads/tools/","contentSize":"15926 B","width":545,"height":300,"cDNContentUrl":"https://th.bing.com/th/id/R.bb27a5b1330eb67233a36510822e470b?rik=7mZSLDp5ym0Jhg&pid=ImgRaw&r=0","isTransparent":true,"imageId":"9CDC6A896A7BFFE6056C86096DCA793A2C5266EE","accentColor":"B86C13"},"F1DB0E21DEC1EE763C0E6212BDF5F3DE15932A48":{"name":"R introduction - ⇧ SCROLL TO TOP Home Java R C Kotlin C++ C# ADO Ruby ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.JMrPNH9md5P5Nx746lf6egHaKe?pid=Api","datePublished":"2023-03-26T11:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/04e81e93b15e799dcc3ea7c4596751fb/thumb_1200_1698.png","hostPageUrl":"https://www.studocu.com/in/document/jawaharlal-nehru-technological-university-anantapur/computer-science-engineering/r-introduction/50530745","contentSize":"17600 B","width":1200,"height":1698,"cDNContentUrl":"https://th.bing.com/th/id/R.24cacf347f667793f9371ef8ea57fa7a?rik=H73gEu0c7mfD4A&pid=ImgRaw&r=0","isTransparent":false,"imageId":"84A23951ED3F5FDB2126E0C367EE1CED12E0BD1F","accentColor":"666666"},"9DB28BE9808FF1F3BA75F46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.GkJabM9SF-TOlX9-S-lffAAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Kush.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"18308 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.1a425a6ccf5217e4ce957f7e4be95f7c?rik=2Su4ngj4Hz%2brVw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064F57AB3F1FF8089EB82BD9","accentColor":"215A50"},"2262ED95DA618C97C9ECFDA8DA3B832F8F768E34":{"name":"Deepest Leaves Sum - DSA Problem | Talentd","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.WTYTZaZY05G0fo0LsHVL1AAAAA?pid=Api","datePublished":"2025-04-26T16:18:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2019/07/31/1483_ex1.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/deepest-leaves-sum","contentSize":"16549 B","width":273,"height":265,"cDNContentUrl":"https://th.bing.com/th/id/R.59361365a658d391b47e8d0bb0754bd4?rik=IibeWa0WyHmczg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"43E867F8F238B3AD8ADFCE9C79C816AD59DE2622","accentColor":"7F9239"},"AD0F5E6D14F00C758E77F46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.rcDVRkOy3PiKXJMXPnDElgAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Amrita.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"17440 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.adc0d54643b2dcf88a5c93173e70c496?rik=2vDl1kEPwFfodw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064F77E857C00F41D6E5F0DA","accentColor":"31666B"},"363379A1285BA9B6E2BF1FC2A11B15B42C7C0223":{"name":"Blue Java Banana / Musa accuminata - Fruits plant & Tree– Exotic Flora","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.U0r5-9D--nGckNqIi61DVwHaHa?pid=Api","datePublished":"2024-03-06T12:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://exoticflora.in/cdn/shop/files/4_1024x1024.png?v=1709276504","hostPageUrl":"https://exoticflora.in/products/blue-java-musa-accuminata-fruits-plant-tree","contentSize":"1514273 B","width":1024,"height":1024,"cDNContentUrl":"https://th.bing.com/th/id/R.534af9fbd0fefa719c90da888bad4357?rik=YzOXGoK1mmsu%2bw&riu=http%3a%2f%2fexoticflora.in%2fcdn%2fshop%2ffiles%2f4_1024x1024.png%3fv%3d1709276504&ehk=B9Wbrb%2f9oBLtWh%2fYnfb0dBt3ZpKWmzzuzJBLxCY5qU8%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3220C7C24B51B11A2CF1FB2E6B9AB5821A973363","accentColor":"0C4C61"},"7652C74E801829452A6FF46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.x8937gx6hhquYGBwGfbWeQAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Ayush-Panuily.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"12922 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.c7cf77ee0c7a861aae60607019f6d679?rik=ZyV85AiBklSi9g&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064FF6A254928108E47C2567","accentColor":"4C4685"},"F587BEEA3F398E83BE2AF24021300B58D7655EF3":{"name":"what are the difference between Binary fission and Budding? - Brainly.in","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.Af8wjk6gWQQJ9DqEhYLpLwHaK7?pid=Api","datePublished":"2019-12-15T03:56:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/def/3bee72d357d48f13f8366e3e4429b93a.jpg","hostPageUrl":"https://brainly.in/question/14120947","contentSize":"65582 B","width":628,"height":927,"cDNContentUrl":"https://th.bing.com/th/id/R.01ff308e4ea0590409f43a848582e92f?rik=X3jrrvOT6Djrog&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3FE5567D85B00312042FA2EB38E893F3AEEB785F","accentColor":"0D7651"},"E7D0FA25477A5A7FC7301FC2A11B15B42C7C0223":{"name":"Blue Java Banana / Musa accuminata - Fruits plant & Tree– Exotic Flora","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.zo3hTAFhQs328-iXz4Mj8gHaHa?pid=Api","datePublished":"2024-03-06T12:36:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://exoticflora.in/cdn/shop/files/5_1024x1024.png?v=1709276503","hostPageUrl":"https://exoticflora.in/products/blue-java-musa-accuminata-fruits-plant-tree","contentSize":"1355227 B","width":1024,"height":1024,"cDNContentUrl":"https://th.bing.com/th/id/R.ce8de14c016142cdf6f3e897cf8323f2?rik=fg2vUnSnpfd8Aw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"3220C7C24B51B11A2CF1037CF7A5A77452AF0D7E","accentColor":"27505B"},"8F55E0E5768B80A1939D6F3C22738B35590209DA":{"name":"Binary Code Nedir? Binary Code Ne Demek, Anlamı ve Tanımı","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.VLkSK1WOeYPnLZfSw9qI6wHaDD?pid=Api","datePublished":"2019-03-23T15:31:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.msxlabs.org/forum/attachments/68504d1553344745-binary-code-nedir-utf8-table-7802.png","hostPageUrl":"https://www.msxlabs.org/forum/x-sozluk/510164-binary-code-nedir.html","contentSize":"199256 B","width":780,"height":321,"cDNContentUrl":"https://th.bing.com/th/id/R.54b9122b558e7983e72d97d2c3da88eb?rik=%2bFUOXme4CBo52Q&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AD90209553B83722C3F6D9391A08B8675E0E55F8","accentColor":"109545"},"76552083A6B18854A838F46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.Le79gyT9Bdq6-gGVkVbIKQAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Kashish.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"9882 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.2deefd8324fd05dabafa01959156c829?rik=Z1UCOGobiEWKgw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064F838A45881B6A38025567","accentColor":"8D773E"},"6BD9F472D7A012F7CB64F46054EEC1C5E27DD3F5":{"name":"DSA Course – Learn Data Structures & Algorithms– 2 Months","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.2z94zpTwhRhjcG122ZEIrAAAAA?pid=Api","datePublished":"2024-05-16T17:35:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oxfordinstitute.in/photo/video-reviews/Vashu-Wadhva.webp","hostPageUrl":"https://oxfordinstitute.in/dsa-course.php","contentSize":"10214 B","width":422,"height":422,"cDNContentUrl":"https://th.bing.com/th/id/R.db3f78ce94f0851863706d76d99108ac?rik=tp1PJ30KIX%2b8Rg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5F3DD72E5C1CEE45064F46BC7F210A7D274F9DB6","accentColor":"6B6062"},"9ADB870D39E4E97EFE5A90CE5C7F038E1E78E05C":{"name":"2049. Count Nodes With the Highest Score - Medium | DSA Corner | Talentd","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.R2d0zmj_4wpCvl6SOI9h2AAAAA?pid=Api","datePublished":"2025-03-06T03:52:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/10/03/example-2.png","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/count-nodes-with-the-highest-score","contentSize":"2426 B","width":95,"height":143,"cDNContentUrl":"https://th.bing.com/th/id/R.476774ce68ffe30a42be5e92388f61d8?rik=qb140JNOnufvpQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C50E87E1E830F7C5EC09A5EFE79E4E93D078BDA9","accentColor":"A86E23"},"8B79D3D05B21D872C0DAA2D46B3FD5906C938D6C":{"name":"Virtual Labs","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.eST-Nbp8Is5Gfv1QTM6T1wAAAA?pid=Api","datePublished":"2021-03-23T09:12:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/assets/images/vlabs-color-small-moe.jpg","hostPageUrl":"https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/reconstructing-binary-tree/from-inorder-and-postorder.html","contentSize":"32248 B","width":138,"height":77,"cDNContentUrl":"https://th.bing.com/th/id/R.7924fe35ba7c22ce467efd504cce93d7?rik=uJc9DbUSjScMrQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"C6D839C6095DF3B64D2AAD0C278D12B50D3D97B8","accentColor":"16699C"},"9763694E671CF3D48B708765EA42F3ED059FAA77":{"name":"RK Seeds - Sterculia foetida seeds Ornamental flower seeds Java Olive ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.CnWQAq4YCSUMjAtcQYCTzQHaE8?pid=Api","datePublished":"2020-09-25T01:02:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/81GS+Z7XoQL.jpg","hostPageUrl":"https://www.amazon.in/RK-Seeds-Sterculia-Ornamental-sterculia/dp/B07PV51NK1","contentSize":"335452 B","width":2560,"height":1707,"cDNContentUrl":"https://th.bing.com/th/id/R.0a759002ae1809250c8c0b5c418093cd?rik=eTaW5HbBP024Bw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"77AAF950DE3F24AE567807B84D3FC176E4963679","accentColor":"51309B"},"50D51E350D9C2F1C04EB2AA7FEB46C6A8E3A6234":{"name":"PRIM's ALGORITHM - MINIMUM SPANNING TREE - IMPLEMENTATION","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.zE_ihPdSLVrEQJUZ4A3NiwHaCp?pid=Api","datePublished":"2020-09-17T18:37:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/PrimsImplementation5.png","hostPageUrl":"https://www.learnerslesson.com/Data-Structures-and-Algorithms/Prim's-Algorithm-Minimum-Spanning-Tree-Implementation.htm","contentSize":"13010 B","width":960,"height":343,"cDNContentUrl":"https://th.bing.com/th/id/R.cc4fe284f7522d5ac4409519e00dcd8b?rik=BV3hU9DJ8sFAvg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"4326A3E8A6C64BEF7AA2BE40C1F2C9D053E15D05","accentColor":"CC3300"},"737AAE1B2311F8BDCB78F145E038BB093DE21701":{"name":"Java Software | Oracle India","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.ZOwN_l8Md9kcmeI439SIcAHaD6?pid=Api","datePublished":"2016-05-06T11:01:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.oracle.com/a/ocom/img/rh03-oracle-java-r1.png","hostPageUrl":"https://www.oracle.com/in/java/","contentSize":"36470 B","width":815,"height":430,"cDNContentUrl":"https://th.bing.com/th/id/R.64ec0dfe5f0c77d91c99e238dfd48870?rik=N6fqsTIRj9u8hw&pid=ImgRaw&r=0","isTransparent":true,"imageId":"10712ED390BB830E541F87BCDB8F1132B1EAA737","accentColor":"40678B"},"F36CFAF7378FD273151268CADA1ADD03CDF1DAF5":{"name":"JAVA EE: Java : Collection Framework : Hierarchy(Iterable,Collection)","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.05SuZYfto9EdP9Y6Xg77PgHaEK?pid=Api","datePublished":"2018-05-27T00:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"http://2.bp.blogspot.com/-EHOexnP0lpY/VR6C4YAlBVI/AAAAAAAAGKE/6Vv5bvZ-qs0/s1600/Java%2B-%2BCollection%2BFramework%2B-%2BHierarchy.jpg","hostPageUrl":"http://ramj2ee.blogspot.in/2015/04/java-collection-framework_73.html","contentSize":"85683 B","width":1366,"height":768,"cDNContentUrl":"https://th.bing.com/th/id/R.d394ae6587eda3d11d3fd63a5e0efb3e?rik=P8avf3P4LTdRIQ&riu=http%3a%2f%2f2.bp.blogspot.com%2f-EHOexnP0lpY%2fVR6C4YAlBVI%2fAAAAAAAAGKE%2f6Vv5bvZ-qs0%2fs1600%2fJava%252B-%252BCollection%252BFramework%252B-%252BHierarchy.jpg&ehk=xwR7cQOGkmsTgi6zUOXxe%2fCWG%2bd6l0OXau2BmcGFk50%3d&risl=&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5FAD1FDC30DDA1ADAC862151372DF8737FAFC63F","accentColor":"C65105"},"687DBA8888803CF20F8C1B2A44DBCBECB23D9CEE":{"name":"Green World STERCULIA FOETIDA / CHINA ALMOND / JAVA OLIVE TREE SEEDS ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.0vb_z8EpC6wPRVQKMO-scAHaGK?pid=Api","datePublished":"2021-08-14T05:32:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://rukminim1.flixcart.com/image/832/832/krwec280/plant-seed/q/g/j/10-sterculia-foetida-china-almond-java-olive-tree-seeds-for-original-imag5hacwefcxnpw.jpeg?q=70","hostPageUrl":"https://www.flipkart.com/green-world-sterculia-foetida-china-almond-java-olive-tree-seeds-farming-gardening-1-kg-seed/p/itm5ff828d9eaae9","contentSize":"62205 B","width":832,"height":693,"cDNContentUrl":"https://th.bing.com/th/id/R.d2f6ffcfc1290bac0f45540a30efac70?rik=hteriIgIwy%2fwyA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"EEC9D32BCEBCBD44A2B1C8F02FC3088888ABD786","accentColor":"7A2620"},"F09DD24D3A4650FB96AB93DAB851392A65704BA9":{"name":"Java Study Point (Java iQ): Java Program Coding Interview Questions","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.WTtgEAq0VJGBxXVt9xSrTgHaFl?pid=Api","datePublished":"2020-05-24T06:53:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://1.bp.blogspot.com/-ONWG5wIHPLU/XMVZuVWECkI/AAAAAAAAFlU/dc3UhvY5858j1i2WlBFoEPxrQ1h-y0GgACLcBGAs/s1600/Decimal-To-Binary-min.jpg","hostPageUrl":"https://www.javaiq.in/2019/04/java-program-coding-interview-questions.html","contentSize":"41922 B","width":600,"height":452,"cDNContentUrl":"https://th.bing.com/th/id/R.593b60100ab4549181c5756df714ab4e?rik=D9kt1KNkBb9pug&pid=ImgRaw&r=0","isTransparent":false,"imageId":"9AB40756A293158BAD39BA69BF0564A3D42DD90F","accentColor":"743D49"},"D0D9381924D2EA48E6E40586BE56894CEB691644":{"name":"Core JAVA - An Integrated Approach - Includes all versions upto JAVA 7 ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.5K5K0YJI95L1qhUbho0lUgHaJr?pid=Api","datePublished":"2023-09-27T02:00:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/71ovn3eRjWL._SL1500_.jpg","hostPageUrl":"https://www.amazon.in/Core-JAVA-Integrated-Approach-versions/dp/B0CJC34BVK","contentSize":"172004 B","width":1148,"height":1500,"cDNContentUrl":"https://th.bing.com/th/id/R.e4ae4ad18248f792f5aa151b868d2552?rik=DZ2DkUItroRuTg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"446196BEC49865EB68504E6E84AE2D4291839D0D","accentColor":"AC761F"},"BB957909F6686C2C4E52050D324ABC8004B42731":{"name":"TAX assignment - tax - FACULTY OF LAW LAW OF TAXATION-II SESSION 2020 ...","thumbnailUrl":"https://tse3.mm.bing.net/th/id/OIP.BKasSgjGqGEif_88BLB23gHaJl?pid=Api","datePublished":"2024-06-22T08:22:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b02853e74013276bda228ab23a9ebac7/thumb_1200_1553.png","hostPageUrl":"https://www.studocu.com/in/document/puducherry-technological-university/constitutional-law/tax-assignment-tax/92995239","contentSize":"472638 B","width":1200,"height":1553,"cDNContentUrl":"https://th.bing.com/th/id/R.04a6ac4a08c6a861227fff3c04b076de?rik=u1mXkG%2bGxsLkJQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"13724B4008CBA423D05025E4C2C6866F909759BB","accentColor":"340E84"},"E4D74C9058053A165A7B263B4F9142DD26AE9C32":{"name":"The ML Hub","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.pd1JCY6XVkSN5LLCtP6EYwHaHg?pid=Api","datePublished":"2024-05-20T12:06:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://appxcontent.kaxa.in/paperimages/17067009681706700968_thump.png","hostPageUrl":"https://web.ravindrababuravula.in/new-courses/28-dsa-in-python","contentSize":"130759 B","width":496,"height":503,"cDNContentUrl":"https://th.bing.com/th/id/R.a5dd49098e9756448de4b2c2b4fe8463?rik=Tn3ECYVQo2Gltw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"23C9EA62DD2419F4B362B7A561A3508509C47D4E","accentColor":"54575A"},"645FD5D75635F5832C0AF1A8C3376DD577D694AA":{"name":"Binary Classification","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.6BBwMs8Tw6VKGYQyNQAT9AHaHE?pid=Api","datePublished":"2017-03-30T14:55:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.cse.iitk.ac.in/users/se367/10/presentation_local/Binary%20Classification_files/svm.png","hostPageUrl":"https://www.cse.iitk.ac.in/users/se367/10/presentation_local/Binary%20Classification.html","contentSize":"34240 B","width":628,"height":600,"cDNContentUrl":"https://th.bing.com/th/id/R.e8107032cf13c3a54a198432350013f4?rik=RvVdfWVTXzjCoA&pid=ImgRaw&r=0","isTransparent":true,"imageId":"AA496D775DD6733C8A1FA0C2385F53657D5DF546","accentColor":"CB0000"},"6D7C85452608C91103F2FF2777406354ADB2886B":{"name":"Alpha Ready (Batch 1)","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.0XSCA0D-cxeQk3hRHoVybgHaFP?pid=Api","datePublished":"2022-07-21T14:43:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://lwfiles.mycourse.app/62a6cd5e1e9e2fbf212d608d-public/cd8389f148da1755ae14c5d06d0978b7.jpeg","hostPageUrl":"https://www.apnacollege.in/course/placement-course-java","contentSize":"172972 B","width":1920,"height":1357,"cDNContentUrl":"https://th.bing.com/th/id/R.d174820340fe7317909378511e85726e?rik=1sdYVGKAnBEwLw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"B6882BDA4536047772FF2F30119C80625458C7D6","accentColor":"05406D"},"50ED90CF38014EB685C4FE5B9E8E195B964F6555":{"name":"Introduction to Compiler Design: An Object-Oriented Approach Using Java ...","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.rt_H3EbCy8ZTfUBoLwMV7AAAAA?pid=Api","datePublished":"2025-01-26T01:16:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://m.media-amazon.com/images/I/41hq8lqsgHL._SX342_SY445_ML2_.jpg","hostPageUrl":"https://www.amazon.in/Introduction-Compiler-Design-Object-Oriented-Approach/dp/1734139110","contentSize":"18419 B","width":342,"height":421,"cDNContentUrl":"https://th.bing.com/th/id/R.aedfc7dc46c2cbc6537d40682f0315ec?rik=Bd4J%2fIMQ5GtYTA&pid=ImgRaw&r=0","isTransparent":false,"imageId":"5556F469B591E8E9B5EF4C586BE41083FC09DE05","accentColor":"023045"},"C7F7CA949ECC3E22496B2F87CE457B6A6252DA74":{"name":"String Handling in Java - Java Tutorial","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.NY7DuFh4hZcNEyIzUE3yUwHaDO?pid=Api","datePublished":"2015-06-13T11:04:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://www.sitesbay.com/java/images/string-handling-in-java.png","hostPageUrl":"https://www.sitesbay.com/java/java-string-handling","contentSize":"23330 B","width":543,"height":236,"cDNContentUrl":"https://th.bing.com/th/id/R.358ec3b8587885970d132233504df253?rik=fH%2bsSenM4yKUtg&pid=ImgRaw&r=0","isTransparent":true,"imageId":"47AD2526A6B754EC78F2B69422E3CCE949AC7F7C","accentColor":"0196CA"},"E5B697986ADB8613B5AAD9EFB5CE8EA97C7C472D":{"name":"GraffitiGRDN Ficus Benjamina Bonsai Weeping Fig Tree Benjamin Fig India ...","thumbnailUrl":"https://tse4.mm.bing.net/th/id/OIP.hVozfF-vuhNoTrvmGULXawHaHa?pid=Api","datePublished":"2022-12-18T10:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://images-cdn.ubuy.co.in/661705fecc8c80511e6be0b4-ficus-benjamina-bonsai-weeping-fig-tree.jpg","hostPageUrl":"https://www.ubuy.co.in/product/4SAMV5MZS-ficus-benjamina-20-seeds-for-planting","contentSize":"70226 B","width":750,"height":750,"cDNContentUrl":"https://th.bing.com/th/id/R.855a337c5fafba13684ebbe61942d76b?rik=Xmt5iaa9aDFbqg&pid=ImgRaw&r=0","isTransparent":false,"imageId":"D274C7C79AE8EC5BFE9DAA5B3168BDA689796B5E","accentColor":"406A33"},"1744DB35CC61C8E57A3CCB6A356236C829C37285":{"name":"Class 9 History Chapter 4 Extra Question Answers - Forest Society and ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.cN6V4AS-_ue4qA6K2PgCeAAAAA?pid=Api","datePublished":"2019-03-02T05:59:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://edurev.gumlet.io/ApplicationImages/Temp/10129244_1212381d-81f2-43b1-86cd-55a4d4a530e1_lg.jpg","hostPageUrl":"https://edurev.in/t/157851/Class-9-History-Chapter-4-Extra-Question-Answers-Forest-Society-and-Colonialism-Deducted-from-CBSE-2021-22-examination","contentSize":"39349 B","width":405,"height":382,"cDNContentUrl":"https://th.bing.com/th/id/R.70de95e004befee7b8a80e8ad8f80278?rik=cUS9U8wWjF6nww&pid=ImgRaw&r=0","isTransparent":false,"imageId":"58273C928C632653A6BCC3A75E8C16CC53BD4471","accentColor":"494949"},"66522368E810A93FD67983D783FB384CB6246B55":{"name":"Difference between binary fission and multiple fission in tabular form ...","thumbnailUrl":"https://tse1.mm.bing.net/th/id/OIP.2SOxdCpOBWRBtvAfS-1Q7QHaHa?pid=Api","datePublished":"2019-10-06T15:10:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://hi-static.z-dn.net/files/d20/bce267256ad3808271ea23f17566dd75.png","hostPageUrl":"https://brainly.in/question/12844258","contentSize":"78563 B","width":750,"height":750,"cDNContentUrl":"https://th.bing.com/th/id/R.d923b1742a4e056441b6f01f4bed50ed?rik=ZiUyho4BmvNtlw&pid=ImgRaw&r=0","isTransparent":false,"imageId":"55B6426BC483BF387D38976DF39A018E86322566","accentColor":"4F667C"},"CDF350C3FFAFA47EC0147283B9541D9749CBFAAA":{"name":"House Robber III - DSA Problem | Talentd","thumbnailUrl":"https://tse2.mm.bing.net/th/id/OIP.Lj1QjAOhTYk_mUdAZhEFYQAAAA?pid=Api","datePublished":"2025-04-23T19:18:00.0000000Z","isFamilyFriendly":true,"contentUrl":"https://assets.leetcode.com/uploads/2021/03/10/rob2-tree.jpg","hostPageUrl":"https://www.talentd.in/dsa-corner/questions/house-robber-iii","contentSize":"13065 B","width":357,"height":293,"cDNContentUrl":"https://th.bing.com/th/id/R.2e3d508c03a14d893f99474066110561?rik=3D8FPP%2f6SucMQQ&pid=ImgRaw&r=0","isTransparent":false,"imageId":"AAAFBC9479D1459B3827410CE74AFAFF3C053FDC","accentColor":"884343"}},"relatedSearches":[{"text":"BFS Tree Example","displayText":"BFS Tree Example","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Tree+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5830.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Tree+Example","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Tree+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Traversal","displayText":"BFS Traversal","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Traversal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5832.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Traversal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Search Tree","displayText":"BFS Search Tree","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Search+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5834.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Search+Tree","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+Search+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Code","displayText":"BFS Code","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Code&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5836.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Code","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+Code&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Depth of a Binary Tree","displayText":"Depth of a Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Depth+of+a+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5838.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Depth+of+a+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Depth+of+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Implementation","displayText":"BFS Implementation","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Implementation&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5840.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Implementation","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Implementation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Height","displayText":"Binary Tree Height","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Height&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5842.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Height","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Binary+Tree+Height&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Nodes","displayText":"Binary Tree Nodes","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Nodes&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5844.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Nodes","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Binary+Tree+Nodes&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Levels","displayText":"Binary Tree Levels","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Levels&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5846.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Levels","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Binary+Tree+Levels&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Algorithm C++","displayText":"BFS Algorithm C++","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Algorithm+C%2b%2b&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5848.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+C%2b%2b","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Algorithm+C%2b%2b&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Complete Binary Tree","displayText":"Complete Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Complete+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5850.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Complete+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Complete+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Breadth First Tree","displayText":"Breadth First Tree","webSearchUrl":"https://www.bing.com/images/search?q=Breadth+First+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5852.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Breadth+First+Tree","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Breadth+First+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Time Complexity of BFS and DFS","displayText":"Time Complexity of BFS and DFS","webSearchUrl":"https://www.bing.com/images/search?q=Time+Complexity+of+BFS+and+DFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5854.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Time+Complexity+of+BFS+and+DFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Time+Complexity+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS DFS Difference","displayText":"BFS DFS Difference","webSearchUrl":"https://www.bing.com/images/search?q=BFS+DFS+Difference&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5856.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+DFS+Difference","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+DFS+Difference&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Simple Binary Tree","displayText":"Simple Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Simple+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5858.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Simple+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Simple+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Space Complexity of BFS","displayText":"Space Complexity of BFS","webSearchUrl":"https://www.bing.com/images/search?q=Space+Complexity+of+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5860.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Space+Complexity+of+BFS","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Space+Complexity+of+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Inorder Tree Traversal","displayText":"Inorder Tree Traversal","webSearchUrl":"https://www.bing.com/images/search?q=Inorder+Tree+Traversal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5862.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Inorder+Tree+Traversal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Inorder+Tree+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Width of a Binary Tree","displayText":"Width of a Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Width+of+a+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5864.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Width+of+a+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Width+of+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS PPT","displayText":"BFS PPT","webSearchUrl":"https://www.bing.com/images/search?q=BFS+PPT&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5866.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+PPT","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+PPT&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"In Order Traversal Binary Tree","displayText":"In Order Traversal Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=In+Order+Traversal+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5868.1","searchLink":"https://www.bing.com/api/v7/images/search?q=In+Order+Traversal+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=In+Order+Traversal+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Postorder Traversal","displayText":"Binary Tree Postorder Traversal","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Postorder+Traversal&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5870.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Postorder+Traversal","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Binary+Tree+Postorder+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Data Structure","displayText":"Binary Tree Data Structure","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Data+Structure&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5872.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Data+Structure","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Binary+Tree+Data+Structure&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree BST","displayText":"Binary Tree BST","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+BST&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5874.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+BST","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Binary+Tree+BST&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Prod in Binary Tree","displayText":"Prod in Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Prod+in+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5876.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Prod+in+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Prod+in+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Tree Bfsp","displayText":"Tree Bfsp","webSearchUrl":"https://www.bing.com/images/search?q=Tree+Bfsp&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5878.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Tree+Bfsp","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Tree+Bfsp&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Maximum Binary Tree","displayText":"Maximum Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Maximum+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5880.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Maximum+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Maximum+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Breadth First Search Graph","displayText":"Breadth First Search Graph","webSearchUrl":"https://www.bing.com/images/search?q=Breadth+First+Search+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5882.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+Graph","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Breadth+First+Search+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree 15","displayText":"Binary Tree 15","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+15&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5884.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+15","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Binary+Tree+15&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"3D Picture of Binary Tree","displayText":"3D Picture of Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=3D+Picture+of+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5886.1","searchLink":"https://www.bing.com/api/v7/images/search?q=3D+Picture+of+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=3D+Picture+of+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree Level. Order","displayText":"Binary Tree Level. Order","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+Level.+Order&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5888.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+Level.+Order","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Binary+Tree+Level.+Order&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"What's DFS Tree","displayText":"What's DFS Tree","webSearchUrl":"https://www.bing.com/images/search?q=What%27s+DFS+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5890.1","searchLink":"https://www.bing.com/api/v7/images/search?q=What%27s+DFS+Tree","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=What%27s+DFS+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree with Pointers","displayText":"Binary Tree with Pointers","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+with+Pointers&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5892.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+with+Pointers","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Binary+Tree+with+Pointers&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Plus Tree","displayText":"Binary Plus Tree","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Plus+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5894.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Plus+Tree","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Binary+Plus+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Differentiate Between DFS and BFS","displayText":"Differentiate Between DFS and BFS","webSearchUrl":"https://www.bing.com/images/search?q=Differentiate+Between+DFS+and+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5896.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Differentiate+Between+DFS+and+BFS","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=Differentiate+Between+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Recursive BFS","displayText":"Recursive BFS","webSearchUrl":"https://www.bing.com/images/search?q=Recursive+BFS&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5898.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Recursive+BFS","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Recursive+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Problems","displayText":"BFS Problems","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Problems&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5900.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Problems","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=BFS+Problems&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Where Is the Leaf within a Binary Tree","displayText":"Where Is the Leaf within a Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Where+Is+the+Leaf+within+a+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5902.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Where+Is+the+Leaf+within+a+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Where+Is+the+Leaf+within+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Tree Traversal Queue","displayText":"BFS Tree Traversal Queue","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Tree+Traversal+Queue&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5904.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Tree+Traversal+Queue","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+Tree+Traversal+Queue&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree vs Binary Search Tree","displayText":"Binary Tree vs Binary Search Tree","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+vs+Binary+Search+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5906.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+vs+Binary+Search+Tree","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=Binary+Tree+vs+Binary+Search+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Small Tree Example","displayText":"BFS Small Tree Example","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Small+Tree+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5908.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Small+Tree+Example","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=BFS+Small+Tree+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tre Graph","displayText":"Binary Tre Graph","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tre+Graph&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5910.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tre+Graph","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Binary+Tre+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Tree Digram","displayText":"BFS Tree Digram","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Tree+Digram&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5912.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Tree+Digram","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+Tree+Digram&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Tree in HTML","displayText":"BFS Tree in HTML","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Tree+in+HTML&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5914.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Tree+in+HTML","thumbnail":{"thumbnailUrl":"https://tse2.mm.bing.net/th?q=BFS+Tree+in+HTML&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"DFS Pre-Order","displayText":"DFS Pre-Order","webSearchUrl":"https://www.bing.com/images/search?q=DFS+Pre-Order&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5916.1","searchLink":"https://www.bing.com/api/v7/images/search?q=DFS+Pre-Order","thumbnail":{"thumbnailUrl":"https://tse4.mm.bing.net/th?q=DFS+Pre-Order&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS and DFS Examples","displayText":"BFS and DFS Examples","webSearchUrl":"https://www.bing.com/images/search?q=BFS+and+DFS+Examples&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5918.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Examples","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+and+DFS+Examples&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"BFS Problem Tree","displayText":"BFS Problem Tree","webSearchUrl":"https://www.bing.com/images/search?q=BFS+Problem+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5920.1","searchLink":"https://www.bing.com/api/v7/images/search?q=BFS+Problem+Tree","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=BFS+Problem+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Binary Tree DFS Animation","displayText":"Binary Tree DFS Animation","webSearchUrl":"https://www.bing.com/images/search?q=Binary+Tree+DFS+Animation&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5922.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Binary+Tree+DFS+Animation","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Binary+Tree+DFS+Animation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Breadth First Search Python Example","displayText":"Breadth First Search Python Example","webSearchUrl":"https://www.bing.com/images/search?q=Breadth+First+Search+Python+Example&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5924.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+Python+Example","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=Breadth+First+Search+Python+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"3 Level Binary Tree","displayText":"3 Level Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=3+Level+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5926.1","searchLink":"https://www.bing.com/api/v7/images/search?q=3+Level+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse3.mm.bing.net/th?q=3+Level+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}},{"text":"Linked Binary Tree","displayText":"Linked Binary Tree","webSearchUrl":"https://www.bing.com/images/search?q=Linked+Binary+Tree&FORM=IRPATC","webSearchUrlPingSuffix":"images.LB.1,5928.1","searchLink":"https://www.bing.com/api/v7/images/search?q=Linked+Binary+Tree","thumbnail":{"thumbnailUrl":"https://tse1.mm.bing.net/th?q=Linked+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1"}}],"createdate":1777837848768}
[curl_error] =>
[product_name_used] => Bfs-Binary-Tree-Java
[parsed] => Array
(
[name] => bfs-binary-tree-java inr loc:in
[totalEstimatedMatches] => 128
[nextOffset] => 120
[currentOffset] => 0
[value] => Array
(
[F236706A6396957D2EB5A5EF1A19F27B06224B72] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ugX0d96v4ah3ETo0tAXTZgHaGn?pid=Api
[datePublished] => 2021-03-23T09:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/images/bfs.jpeg
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/breadth-first-traversal-theory.html
[contentSize] => 40472 B
[width] => 651
[height] => 581
[cDNContentUrl] => https://th.bing.com/th/id/R.ba05f477deafe1a877113a34b405d366?rik=L2MHpjZpWdfiWw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 27B42260B72F91A1FE5A5BE2D7596936A607632F
[accentColor] => 2777A4
)
[988A670F0A852D1015AF6ED37B8543EBBF86BDA3] => Array
(
[name] => BINARY TREES
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.6yxBblOztneqdcSHFc03fwHaFv?pid=Api
[datePublished] => 2020-08-04T09:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree10.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm
[contentSize] => 192757 B
[width] => 1596
[height] => 1236
[cDNContentUrl] => https://th.bing.com/th/id/R.eb2c416e53b3b677aa75c48715cd377f?rik=iah28KBY0gFR%2bg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3ADB68FBBE3458B73DE6FA5101D258A0F076A889
[accentColor] => C63A05
)
[A40A32EB853A88BAF9AD6B07F440346E4C40BC8E] => Array
(
[name] => Java - Binary Trees - Java - DSA Trees 1. Build Tree from given ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.cLKm9BfuMqgJD9zEVvx_6wHaJl?pid=Api
[datePublished] => 2024-06-13T16:17:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/4c5374913f3b9ef3b84a1c82e22f154a/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/gl-bajaj-institute-of-technology-and-management/data-structure/java-binary-trees/92824002
[contentSize] => 162944 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.70b2a6f417ee32a8090fdcc456fc7feb?rik=SqAjvlijiKuf2g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E8CB04C4E643044F70B6DA9FAB88A358BE23A04A
[accentColor] => 345A4E
)
[F8402F38D83AAAA3B1057044EE481578A6EB7F3D] => Array
(
[name] => BFS-BREADTH FIRST SEARCH
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.dnfqKjmcyx9cKR9p0c0x_AHaD0?pid=Api
[datePublished] => 2020-10-05T17:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode30.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm
[contentSize] => 96624 B
[width] => 1282
[height] => 662
[cDNContentUrl] => https://th.bing.com/th/id/R.7677ea2a399ccb1f5c291f69d1cd31fc?rik=jwTyg42jqjobUA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D3F7BE6A875184EE4407501B3AAAA38D83F2048F
[accentColor] => C73904
)
[BD023B28125035B288B7D721519EE455A2EC625E] => Array
(
[name] => Programming in C: Tree BFS
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.youRThjpCB0vfo4EVTVPWAAAAA?pid=Api
[datePublished] => 2018-05-03T05:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=15325516965057815059
[hostPageUrl] => https://gateoverflow.in/105129/tree-bfs
[contentSize] => 31166 B
[width] => 386
[height] => 376
[cDNContentUrl] => https://th.bing.com/th/id/R.ca8b914e18e9081d2f7e8e0455354f58?rik=2yCzgiEFUyuIew&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E526CE2A554EE915127D7B882B53052182B320DB
[accentColor] => A93F22
)
[FC5A00AA02E2609F298EDB89DF1E2A795BA7B82F] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.OmRV7P0YluY2ToRj44jKGAAAAA?pid=Api
[datePublished] => 2021-03-23T10:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/binary-search-trees/analysis/images/Binary_search_tree_example.gif
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/binary-search-trees/analysis/relationships.html
[contentSize] => 123777 B
[width] => 450
[height] => 378
[proxyContentUrl] => https://tse3.mm.bing.net/th/id/OGC.3a6455ecfd1896e6364e8463e388ca18?pid=Api&rurl=https%3a%2f%2fds1-iiith.vlabs.ac.in%2fexp%2fbinary-search-trees%2fanalysis%2fimages%2fBinary_search_tree_example.gif&ehk=LrsLhUAGxY3wzUycvq4VqR3F3HRFTVbHDBWzMoh7BE8%3d
[cDNContentUrl] => https://th.bing.com/th/id/R.3a6455ecfd1896e6364e8463e388ca18?rik=z6UAqiAuBvmS6A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F28B7AB597A2E1FD98BDE892F9062E20AA00A5CF
[accentColor] => B45E17
)
[DFAA130D99C395646FC605DFB2DF8DD40AF76DA1] => Array
(
[name] => BFS vs DFS for Binary Tree - Class 8 PDF Download
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.GGlHYP-RglnmphEiSXAQTQAAAA?pid=Api
[datePublished] => 2022-05-31T21:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/12234737_26d6f0fb-b3b0-42f2-a6db-18df75c754bd_lg.png
[hostPageUrl] => https://edurev.in/t/230690/BFS-vs-DFS-for-Binary-Tree
[contentSize] => 7569 B
[width] => 289
[height] => 170
[cDNContentUrl] => https://th.bing.com/th/id/R.18694760ff918259e6a611224970104d?rik=%2faox0Jk8WUb2bA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1AD67FA04DD8FD2BFD506CF646593C99D031AAFD
[accentColor] => 963B35
)
[6EEA66ADA9B6356F1E33BA6F7E18994902A9644F] => Array
(
[name] => Explain DFS and BFS with example | summer-2014
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.X4p-jhXiN1G3L9RtLPzjuQAAAA?pid=Api
[datePublished] => 2020-12-26T17:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/BFS_Example.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2014/Question-4-a
[contentSize] => 7469 B
[width] => 381
[height] => 179
[cDNContentUrl] => https://th.bing.com/th/id/R.5f8a7e8e15e23751b72fd46d2cfce3b9?rik=5q5m2pprU%2fbhMw&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fBFS_Example.png&ehk=dra2N96gsHnbuXImuqLsn2s4aaZekXzIqw2zN81fHpE%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F4469A20949981E7F6AB33E1F6536B9ADA66AEE6
[accentColor] => 3C3C3C
)
[BAF205C6708699B38029CB7A8C7A6C3B34E20B31] => Array
(
[name] => BINARY SEARCH TREE
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.HTZPpkDoijdfvHorMp5PWAHaHD?pid=Api
[datePublished] => 2020-08-04T06:02:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/Binarysearchtree11.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search-Tree.htm
[contentSize] => 54120 B
[width] => 578
[height] => 550
[cDNContentUrl] => https://th.bing.com/th/id/R.1d364fa640e88a375fbc7a2b329e4f58?rik=qy9QbAdomTsIkg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 13B02E43B3C6A7C8A7BC92083B9968076C502FAB
[accentColor] => C73904
)
[E7F326CB693DFA6ED4425FAA85D9FB2E4DF5C40B] => Array
(
[name] => T03a.Binary Tree Theorems - Full and Complete Binary Trees Here are two ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.-VYQGCr9Kru1yhOXedrtogHaFu?pid=Api
[datePublished] => 2023-09-25T14:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/344eaad31a79e619fd4abff90f63a054/thumb_1200_927.png
[hostPageUrl] => https://www.studocu.com/in/document/guru-nanak-dev-university/btech-computer-science-engineering/t03abinary-tree-theorems/70243009
[contentSize] => 142589 B
[width] => 1200
[height] => 927
[cDNContentUrl] => https://th.bing.com/th/id/R.f95610182afd2abbb5ca139779daeda2?rik=fj9ivJbTr%2bZNJA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B04C5FD4E2BF9D58AAF5244DE6AFD396BC623F7E
[accentColor] => CC4E00
)
[CA1B3CB388FA599A94BD6ED37B8543EBBF86BDA3] => Array
(
[name] => BINARY TREES
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.BUzl-WjOcVcrdCAJ7RF68gHaI9?pid=Api
[datePublished] => 2020-08-04T09:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree7.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm
[contentSize] => 120617 B
[width] => 984
[height] => 1190
[cDNContentUrl] => https://th.bing.com/th/id/R.054ce5f968ce71572b742009ed117af2?rik=rLHDO4ivlalJ2w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3ADB68FBBE3458B73DE6DB49A995AF883BC3B1AC
[accentColor] => C63905
)
[5D5E57927023D934B11CB07FA36B8180D0ACDE2F] => Array
(
[name] => 257. Binary Tree Paths - Easy | DSA Corner | Talentd
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP._xzbrE8VFzCCZrO6DXGOgwAAAA?pid=Api
[datePublished] => 2025-04-21T16:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/binary-tree-paths
[contentSize] => 8238 B
[width] => 207
[height] => 293
[cDNContentUrl] => https://th.bing.com/th/id/R.ff1cdbac4f1517308266b3ba0d718e83?rik=1eV1KQcynUMbwQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F2EDCA0D0818B63AF70BC11B439D32072975E5D5
[accentColor] => 666666
)
[B2A0817CB630605F52B6E757C6BA473B6516C0F8] => Array
(
[name] => Explain Threaded binary trees with suitable examples. | summer-2019
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.iCYaK-6udZlLD4I4wj6RCQAAAA?pid=Api
[datePublished] => 2022-12-13T01:07:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://www.gtu-paper-solution.com/upload/2130702/Question_Images/Binary_Tree_For_TBT.png
[hostPageUrl] => https://gtu-paper-solution.com/Paper-Solution/datastructure-2130702/summer-2019/Question-5-b
[contentSize] => 24941 B
[width] => 321
[height] => 326
[cDNContentUrl] => https://th.bing.com/th/id/R.88261a2beeae75994b0f8238c23e9109?rik=KwoYx2sDBvUlaw&riu=http%3a%2f%2fwww.gtu-paper-solution.com%2fupload%2f2130702%2fQuestion_Images%2fBinary_Tree_For_TBT.png&ehk=7TidEzMEI%2bOjFGnzR2brJr6bZkhYxGtBWz7bpgoE7P4%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8F0C6156B374AB6C757E6B25F506036BC7180A2B
[accentColor] => 2A76A1
)
[ACAB20C807173698C79EC887D52617C65A83977E] => Array
(
[name] => BFS (Breadth-first search) Algorithm - Algorithms - Computer Science ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.4HOcdm_bd_oTJsHRlI-3swAAAA?pid=Api
[datePublished] => 2022-11-28T18:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_3270b03b-cb1b-4402-abce-6e9e1281de36_lg.png
[hostPageUrl] => https://edurev.in/t/248464/BFS--Breadth-first-search--Algorithm
[contentSize] => 13024 B
[width] => 248
[height] => 276
[cDNContentUrl] => https://th.bing.com/th/id/R.e0739c766fdb77fa1326c1d1948fb7b3?rik=yroCjHBxY4l86Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E77938A56C71625D788CE97C896371708C02BACA
[accentColor] => 666666
)
[EE89DE11E3B672BB3D7BF8DB08363306AE05068F] => Array
(
[name] => Binary Search Algorithm | Step-by-Step Animation
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.vO61I_gV42-tD6sHxtS9oAHaDt?pid=Api
[datePublished] => 2025-04-11T19:02:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://dsavisualizer.in/og/searching/binarySearch.png
[hostPageUrl] => https://www.dsavisualizer.in/visualizer/searching/binarysearch
[contentSize] => 135307 B
[width] => 3780
[height] => 1890
[cDNContentUrl] => https://th.bing.com/th/id/R.bceeb523f815e36fad0fab07c6d4bda0?rik=7pjtET5rJ7vTtw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F86050EA60336380BD8FB7D3BB276B3E11ED98EE
[accentColor] => 00B853
)
[26811BC36D932757E8E845BDD6BDA28155325842] => Array
(
[name] => Full Binary Tree vs Complete binary tree in data structure - Full ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.Th4mBm9W4Y4rkYvtkk9nuQHaKe?pid=Api
[datePublished] => 2022-05-08T19:51:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/a3a9b112088655a821d1318bb8e6a34c/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/apj-abdul-kalam-technological-university/btech/full-binary-tree-vs-complete-binary-tree-in-data-structure/22769253
[contentSize] => 225017 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.4e1e26066f56e18e2b918bed924f67b9?rik=YhixPNY5cnWOjg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 24852355182ADB6DDB548E8E757239D63CB11862
[accentColor] => 254564
)
[87331BB00776433B55EF83C1E4F58FDA6CBF3112] => Array
(
[name] => Binary Tree Node in SQL : Online Learning Center
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Y2EzEPMK49Os3OEHzftaawAAAA?pid=Api
[datePublished] => 2023-02-19T20:00:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.onlinelearningcenter.in/files/blog/post/245/img-0.png
[hostPageUrl] => https://www.onlinelearningcenter.in/blog/database/sql/basic/binary-tree-node-in-sql
[contentSize] => 88829 B
[width] => 474
[height] => 251
[cDNContentUrl] => https://th.bing.com/th/id/R.63613310f30ae3d3acdce107cdfb5a6b?rik=eDOxC3BnNLNV%2fg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2113FBC6ADF85F4E1C38FE55B33467700BB13378
[accentColor] => C3A208
)
[4DA14847713F6B3DD3FE3C57F5F57760CC9946EC] => Array
(
[name] => DS: DS-BFS
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.pXXsVJoLY4ruKQQynNKHLAHaFj?pid=Api
[datePublished] => 2017-06-19T06:21:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=2037941273239483355
[hostPageUrl] => https://gateoverflow.in/103780/ds-bfs
[contentSize] => 11909 B
[width] => 600
[height] => 450
[cDNContentUrl] => https://th.bing.com/th/id/R.a575ec549a0b638aee2904329cd2872c?rik=1BqEdBfzttM97w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CE6499CC06775F5F75C3EF3DD3B6F31774841AD4
[accentColor] => 1D1D1D
)
[2CF71B730FAE8A349B68DAA4BD587AE267A5B155] => Array
(
[name] => What are the types of threaded binary tree explain with example ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.bEO5bHY1tLQYL-vtoI9hUAHaFQ?pid=Api
[datePublished] => 2018-05-29T11:26:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d80/a95860b2c22150f4d0b7036a7833381a.jpg
[hostPageUrl] => https://brainly.in/question/3786858
[contentSize] => 65372 B
[width] => 711
[height] => 505
[cDNContentUrl] => https://th.bing.com/th/id/R.6c43b96c7635b4b4182febeda08f6150?rik=wn%2bxN%2fDqqEO5hg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 551B5A762EA785DB4AAD86B943A8EAF037B17FC2
[accentColor] => A79224
)
[23543DF81F4BA12452576ED37B8543EBBF86BDA3] => Array
(
[name] => BINARY TREES
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Aqseg7pufThZM7pVrrLkowAAAA?pid=Api
[datePublished] => 2020-08-04T09:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinaryTree8.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm
[contentSize] => 45432 B
[width] => 442
[height] => 396
[cDNContentUrl] => https://th.bing.com/th/id/R.02ab1e83ba6e7d385933ba55aeb2e4a3?rik=MkXTj%2fG0GkIldQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3ADB68FBBE3458B73DE67525421AB4F18FD34532
[accentColor] => C83803
)
[07F864B852A3CF5AB171B62B0CBC057B3BB74E0A] => Array
(
[name] => 4.2 Binary Trees
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.86yN7ef31_93tbP-ngzTmgHaB3?pid=Api
[datePublished] => 2014-11-28T17:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img158.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node87.html
[contentSize] => 4741 B
[width] => 1003
[height] => 253
[cDNContentUrl] => https://th.bing.com/th/id/R.f3ac8dede7f7d7ff77b5b3fe9e0cd39a?rik=cI9GiyU6%2fKUbFw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0E47BB3B750CBC0B26B171BA5FC3A258B468F70
[accentColor] => 3E3E3E
)
[57EE0FAA071532C7694D0EC44CB3C71CF5993D47] => Array
(
[name] => Explain with example DFS and BFS traversal of graph. | Winter-2015
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.OvEFQpvcxXUSh-89DWaN9AAAAA?pid=Api
[datePublished] => 2021-01-04T12:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://gtu-paper-solution.com/upload/2130702/S2019/DFS_Example.png
[hostPageUrl] => https://www.gtu-paper-solution.com/Paper-Solution/DataStructure-2130702/Winter-2015/Question-5-b
[contentSize] => 24185 B
[width] => 406
[height] => 230
[cDNContentUrl] => https://th.bing.com/th/id/R.3af105429bdcc5751287ef3d0d668df4?rik=de7wqnBRI3yW1A&riu=http%3a%2f%2fgtu-paper-solution.com%2fupload%2f2130702%2fS2019%2fDFS_Example.png&ehk=azueXLkfjIxbKuTR1P6uchitrSbBRy1RK2xVFdJ7UKs%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 74D3995FC17C3BC44CE0D4967C235170AAF0EE75
[accentColor] => 9A6C31
)
[A76667F5069D5CCFA013F938735C3CC00A7CBFF5] => Array
(
[name] => BINARY SEARCH
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.QWoUzrysQ-J7LkcnEGRYxwHaGj?pid=Api
[datePublished] => 2020-08-04T08:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinarySearching8.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search.htm
[contentSize] => 30336 B
[width] => 997
[height] => 883
[cDNContentUrl] => https://th.bing.com/th/id/R.416a14cebcac43e27b2e4727106458c7?rik=emZ2X2DZxfwKMQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FFBC7A00CC3C537839F310AFCC5D9605F76667A
[accentColor] => BC0F1A
)
[F2C9A1793D353689AC81FA1A0809F0EF898A8269] => Array
(
[name] => Univalued Binary Tree - DSA Problem | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.9AsZU7xlDAI9Iyy0oDRZ9gAAAA?pid=Api
[datePublished] => 2025-04-21T18:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2018/12/28/unival_bst_2.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/univalued-binary-tree
[contentSize] => 7159 B
[width] => 198
[height] => 169
[cDNContentUrl] => https://th.bing.com/th/id/R.f40b1953bc650c023d232cb4a03459f6?rik=L5wal9NTY5jKGA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9628A898FE0F9080A1AF18CA986353D3971A9C2F
[accentColor] => 516D7A
)
[A45664C42681C86D6B466ED37B8543EBBF86BDA3] => Array
(
[name] => BINARY TREES
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.RtLqSxNtCr-jdNtkrpAylgHaHa?pid=Api
[datePublished] => 2020-08-04T09:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/logo.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Trees.htm
[contentSize] => 123040 B
[width] => 500
[height] => 500
[cDNContentUrl] => https://th.bing.com/th/id/R.46d2ea4b136d0abfa374db64ae903296?rik=SmVGTGIYjNa2ZA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3ADB68FBBE3458B73DE664B6D68C18624C46654A
[accentColor] => C49E07
)
[635E8BC9650E2CF60EA746A8D716D86453ACE3A8] => Array
(
[name] => BFS.pdf - BFS ALGORITHM import java.*; public class bfs { private int V ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fjd7u5rVAhh7B1PROwgYawHaKe?pid=Api
[datePublished] => 2024-04-16T08:49:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/47e64d60d8d5e46ce9965eceacb52c19/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/savitribai-phule-pune-university/computer-engineering/bfspdf/90024442
[contentSize] => 60026 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.7e377bbb9ad502187b0753d13b08186b?rik=NuW4nFbgwm%2fgeg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8A3ECA35468D617D8A647AE06FC2E0569CB8E536
[accentColor] => 434343
)
[4192BE0EF5BA30963D17A25EE0C243518A668E19] => Array
(
[name] => Ai mcqs - For a perfect binary tree of BFS resists the nodes in the ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.nLHRnAtupV3YMk2Dulm_vgHaKd?pid=Api
[datePublished] => 2024-05-26T09:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/7a9d8947a38aa35bd90ed9c903c83e00/thumb_1200_1696.png
[hostPageUrl] => https://www.studocu.com/in/document/srm-institute-of-science-and-technology/social-engineering/ai-mcqs/94100462
[contentSize] => 92116 B
[width] => 1200
[height] => 1696
[cDNContentUrl] => https://th.bing.com/th/id/R.9cb1d19c0b6ea55dd8324d83ba59bfbe?rik=FCnr4F%2brA2nTcQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 91E866A815342C0EE52A71D36903AB5FE0EB2914
[accentColor] => 9C9C00
)
[75701ABE528AA1BCCC847DB0BC50A8D27E3BA61A] => Array
(
[name] => Construct a complete binary tree - util; import java.util; // A Binary ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.clvIl8-_lukcRqIyZSpeDgHaJl?pid=Api
[datePublished] => 2022-05-26T21:06:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/3d91df8af3ef65696a32cde683e8345c/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/kannur-university/java-programming/construct-a-complete-binary-tree/27334265
[contentSize] => 61964 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.725bc897cfbf96e91c46a232652a5e0e?rik=Vweh6yWoGsvMSA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A16AB3E72D8A05CB0BD748CCCB1AA825EBA10757
[accentColor] => 4D4D4D
)
[844C9959AB22E56150A95ECEBACFD71193303CA5] => Array
(
[name] => 199. Binary Tree Right Side View - Medium | DSA Corner | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.cLdzLVWf0I1LWMSIFCwyRAHaD1?pid=Api
[datePublished] => 2025-04-20T17:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/binary-tree-right-side-view
[contentSize] => 13025 B
[width] => 671
[height] => 348
[cDNContentUrl] => https://th.bing.com/th/id/R.70b7732d559fd08d4b58c488142c3244?rik=SMSZlboiXhYFmg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5AC30339117DFCABECE59A05165E22BA9599C448
[accentColor] => 343434
)
[E98D9E81D1714C06714DDD5EACFDB85DF97CD056] => Array
(
[name] => 226. Invert Binary Tree - Easy | DSA Corner | Talentd
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.1qeWkhBAFPxbNmwt8i9_4wHaBx?pid=Api
[datePublished] => 2025-04-20T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/03/14/invert2-tree.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/invert-binary-tree
[contentSize] => 15045 B
[width] => 761
[height] => 182
[cDNContentUrl] => https://th.bing.com/th/id/R.d6a79692104014fc5b366c2df22f7fe3?rik=ntjpGB0XxGAX1A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 650DC79FD58BDFCAE5DDD41760C4171D18E9D89E
[accentColor] => 517A7A
)
[352617263408A166518F39615F231D69756D91DC] => Array
(
[name] => 111. Minimum Depth of Binary Tree - Easy | DSA Corner | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.IkAedKuHyR49PpaHoztArwAAAA?pid=Api
[datePublished] => 2025-04-20T17:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/minimum-depth-of-binary-tree
[contentSize] => 12800 B
[width] => 432
[height] => 302
[cDNContentUrl] => https://th.bing.com/th/id/R.22401e74ab87c91e3d3e9687a33b40af?rik=U2JxYkOAGmYV%2bA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CD19D65796D132F51693F815661A804362716253
[accentColor] => 666666
)
[EEA0A475E764FBFC3FD56F7E525E50FD6D190A22] => Array
(
[name] => Master BFS & DFS: Essential Graph Algorithms Explained –Notes
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.isKhWw9TC1zIau0FKbnjdQHaEK?pid=Api
[datePublished] => 2025-07-08T19:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://notes.suhaib.in/images/featured/demystifying-binary-trees-a-hands-on-guide-25626507.jpg
[hostPageUrl] => https://notes.suhaib.in/docs/code/graph/theory/graph-traversals---bfs--dfs/
[contentSize] => 60274 B
[width] => 1880
[height] => 1058
[cDNContentUrl] => https://th.bing.com/th/id/R.8ac2a15b0f530b5cc86aed0529b9e375?rik=7gpKV35Gv8%2fzXQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 22A091D6DF05E525E7F65DF3CFBF467E574A0AEE
[accentColor] => 646766
)
[7310743EBE2A7CA82E08A1B673F30D6F244F200C] => Array
(
[name] => Strictly Binary Tree - Programming and Data Structures - Computer ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.RkHiGmyINlgtfoCO1H78AAHaI1?pid=Api
[datePublished] => 2022-11-27T01:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/1611931_8665d50f-1420-4bf9-b01a-eb773b21fdaa_lg.jpg
[hostPageUrl] => https://edurev.in/t/248568/Strictly-Binary-Tree
[contentSize] => 15099 B
[width] => 500
[height] => 596
[cDNContentUrl] => https://th.bing.com/th/id/R.4641e21a6c8836582d7e808ed47efc00?rik=NwFH4%2buix4rigA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C002F442F6D03F376B1A80E28AC7A2EBE3470137
[accentColor] => 181818
)
[82AB871F583D16A72807448FA7C05B1A4EBBD95D] => Array
(
[name] => 4.4 Binary Search Tree
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.n4m08owNIY628yEggYOX4gAAAA?pid=Api
[datePublished] => 2018-11-07T01:15:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img167.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node91.html
[contentSize] => 4159 B
[width] => 341
[height] => 629
[cDNContentUrl] => https://th.bing.com/th/id/R.9f89b4f28c0d218eb6f32120818397e2?rik=KLp48YXTYXqCcA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D59DBBE4A1B50C7AF84470827A61D385F178BA28
[accentColor] => 2F2F2F
)
[957F5414BCFB05166413E3944C711BF8D279DE6D] => Array
(
[name] => 2096. Step-By-Step Directions From a Binary Tree Node to Another ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.zIl5hozJJXHvyjkxXr_hBQAAAA?pid=Api
[datePublished] => 2025-04-20T17:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/11/15/eg2.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/step-by-step-directions-from-a-binary-tree-node-to-another
[contentSize] => 4149 B
[width] => 74
[height] => 102
[cDNContentUrl] => https://th.bing.com/th/id/R.cc8979868cc92571efca39315ebfe105?rik=WfdFQcu%2fUGFGMQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D6ED972D8FB117C4493E31466150BFCB4145F759
[accentColor] => A40942
)
[C553034E620E830445A38310184FB23A855163A1] => Array
(
[name] => 513. Find Bottom Left Tree Value - Medium | DSA Corner | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.HVzVk7SfgIpznNY656B26wAAAA?pid=Api
[datePublished] => 2025-03-07T14:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/find-bottom-left-tree-value
[contentSize] => 6825 B
[width] => 302
[height] => 182
[cDNContentUrl] => https://th.bing.com/th/id/R.1d5cd593b49f808a739cd63ae7a076eb?rik=XDUw5CbgOEBUOg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1A361558A32BF48101383A544038E026E430355C
[accentColor] => 666666
)
[0DB6A522935A7C5092E57044EE481578A6EB7F3D] => Array
(
[name] => BFS-BREADTH FIRST SEARCH
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.cEX2DVjViCWk6LXxjJ6idQHaIe?pid=Api
[datePublished] => 2020-10-05T17:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode10.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm
[contentSize] => 107258 B
[width] => 632
[height] => 723
[cDNContentUrl] => https://th.bing.com/th/id/R.7045f60d58d58825a4e8b5f18c9ea275?rik=0GtaIjmlxwUpXg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D3F7BE6A875184EE44075E2905C7A539225A6BD0
[accentColor] => CAA301
)
[8519077531F57B60EF519C0F778FB6E63AA6105E] => Array
(
[name] => BFS for digraph while taking input from user - util; import java.util ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.rl9NvAXY0WVhMw7xxNdG5QHaJl?pid=Api
[datePublished] => 2024-08-03T21:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/1ac4149a58dea90e4863214406f6c142/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-visvesvaraya-college-of-engineering/computer-science-and-engineering/bfs-for-digraph-while-taking-input-from-user/100520921
[contentSize] => 85612 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.ae5f4dbc05d8d16561330ef1c4d746e5?rik=WJFwVxNftwb%2bFQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E5016AA36E6BF877F0C915FE06B75F1357709158
[accentColor] => 666666
)
[C3D9CE07ADD4B990F1D1D0CA12B2DF7F0A68E487] => Array
(
[name] => Operators in Java - Java Tutorial
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.sO8Laqcdi7FYgI9dgsmAegHaEK?pid=Api
[datePublished] => 2015-06-10T02:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.sitesbay.com/java/images/basic-java/operator-java.png
[hostPageUrl] => https://www.sitesbay.com/java/operators-in-java
[contentSize] => 6480 B
[width] => 561
[height] => 315
[cDNContentUrl] => https://th.bing.com/th/id/R.b0ef0b6aa71d8bb158808f5d82c9807a?rik=PJ3scNpNmwkfHQ&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 784E86A0F7FD2B21AC0D1D1F099B4DDA70EC9D3C
[accentColor] => 364895
)
[9ABE15E8E4EF421012EC15009A5CDF80309B18B3] => Array
(
[name] => III ECE DS 11, 13 programs - 11. Write Java programs for the ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.h_hrs98B6RDIaaK4aJbSkgHaJl?pid=Api
[datePublished] => 2023-03-08T08:38:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/04240ce0fe443c8f2afa4a6fac171bee/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/vignans-foundation-for-science-technology-and-research/basics-of-electrical-and-electronics-engineering/iii-ece-ds-11-13-programs/39628284
[contentSize] => 191617 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.87f86bb3df01e910c869a2b86896d292?rik=qetRjk7%2bJAEhzg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3B81B90308FDC5A90051CE210124FE4E8E51EBA9
[accentColor] => 4B4849
)
[37B125A38F259CA089025AE057FCBB85ADA250D3] => Array
(
[name] => Breadth First Search - Bfs structure - Breadth First Search The only ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.UzmdLGbiUaE7SODg9uQqnAHaJl?pid=Api
[datePublished] => 2023-06-13T03:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/476ffa13865835370423d560050c4765/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-calicut/artificial-intelligence/breadth-first-search-bfs-structure/46009211
[contentSize] => 297282 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.53399d2c66e251a13b48e0e0f6e42a9c?rik=cxtSOvhSyQqYIA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3D052ADA58BBCF750EA520980AC952F83A521B73
[accentColor] => 078D07
)
[F9C3CAAF933D761B2AA8AF8EE2C909E56E4F7AB5] => Array
(
[name] => Programming in C: IIIT PGEE 2019
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.hLC9djANvZ_DXZMg3UKW0AHaDw?pid=Api
[datePublished] => 2019-04-28T23:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.gatevidyalay.com/wp-content/uploads/2018/07/Skewed-Binary-Tree-Example.png
[hostPageUrl] => https://gateoverflow.in/310938/iiit-pgee-2019
[contentSize] => 8671 B
[width] => 542
[height] => 275
[cDNContentUrl] => https://th.bing.com/th/id/R.84b0bd76300dbd9fc35d9320dd4296d0?rik=nzys%2bjnTZ7Giig&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5BA7F4E65E909C2EE8FA8AA2B167D339FAAC3C9F
[accentColor] => CC6600
)
[60B0B8103C787FC520C293CC7A52E65B44C2EB9C] => Array
(
[name] => TREE TRAVERSAL CODE
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.303xHOWvaCXi7NhT3yVMqgHaD6?pid=Api
[datePublished] => 2020-10-12T02:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/TreeTraversalCode1.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Tree-Traversal-Code.htm
[contentSize] => 111931 B
[width] => 1241
[height] => 657
[cDNContentUrl] => https://th.bing.com/th/id/R.df4df11ce5af6825e2ecd853df254caa?rik=BguLAcOH91wCLA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C9BE2C44B56E25A7CC392C025CF787C3018B0B06
[accentColor] => C63A05
)
[419134C63EE5D74C4226F16891AA3EED6F074EFB] => Array
(
[name] => 8.2.1 Breadth-first search of undirected graph
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.wBAUecpF5W5C0rH1GaR0BAHaGc?pid=Api
[datePublished] => 2020-08-15T19:55:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gtl.csa.iisc.ac.in/dsa/img415.gif
[hostPageUrl] => https://gtl.csa.iisc.ac.in/dsa/node180.html
[contentSize] => 5128 B
[width] => 690
[height] => 600
[cDNContentUrl] => https://th.bing.com/th/id/R.c0101479ca45e56e42d2b1f519a47404?rik=FBlDbONefcQkYg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => BFE470F6DEE3AA19861F6224C47D5EE36C431914
[accentColor] => 2C2C2C
)
[C25E0E995AE8CF1C282CC623BA1D45DCF64141A2] => Array
(
[name] => 687. Longest Univalue Path - Medium | DSA Corner | Talentd
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.VYjBPJazUIGHDtfOmB_y4AHaD6?pid=Api
[datePublished] => 2025-03-06T03:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/10/13/ex2.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/longest-univalue-path
[contentSize] => 15233 B
[width] => 571
[height] => 302
[cDNContentUrl] => https://th.bing.com/th/id/R.5588c13c96b35081870ed7ce981ff2e0?rik=LOXgmaWO%2fMGCwg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2A14146FCD54D1AB326CC282C1FC8EA599E0E52C
[accentColor] => 326699
)
[3EBFB0D5BB1F872EE0D4B32B0AC9FAAD986EA484] => Array
(
[name] => Find Duplicate Subtrees - DSA Problem | Talentd
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.gYBJkHRa8aiSyCZ84gZL-gHaF0?pid=Api
[datePublished] => 2025-04-26T01:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/08/16/e1.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/find-duplicate-subtrees
[contentSize] => 19885 B
[width] => 561
[height] => 441
[cDNContentUrl] => https://th.bing.com/th/id/R.81804990745af1a892c8267ce2064bfa?rik=4%2fsLXbvxeOIOTQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 484AE689DAAF9CA0B23B4D0EE278F1BB5D0BFBE3
[accentColor] => 436688
)
[9E4110B1619E42FAE25B7044EE481578A6EB7F3D] => Array
(
[name] => BFS-BREADTH FIRST SEARCH
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.IENg8ogEp_77vrgIJvbZigHaIh?pid=Api
[datePublished] => 2020-10-05T17:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/AdjacencyMatixcode4.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Breadth-First-Search.htm
[contentSize] => 95807 B
[width] => 627
[height] => 722
[cDNContentUrl] => https://th.bing.com/th/id/R.204360f28804a7fefbbeb80826f6d98a?rik=6RQBGxbpJK8utQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D3F7BE6A875184EE4407B52EAF24E9161B0114E9
[accentColor] => 02B651
)
[22F8E8493F35F4ED59B2670F401CDAC77A0F6FD8] => Array
(
[name] => Ashwani Blog
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.o23dagqqzSzesNJjospgVgHaEH?pid=Api
[datePublished] => 2022-08-30T22:25:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://media.geeksforgeeks.org/wp-content/uploads/20220309171621/BinarySearch.png
[hostPageUrl] => https://blog.ashwanikumarsingh.in/blogposts/binary-search
[contentSize] => 179900 B
[width] => 720
[height] => 401
[cDNContentUrl] => https://th.bing.com/th/id/R.a36ddd6a0aaacd2cdeb0d263a2ca6056?rik=Io%2bOlPNTT96VKw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 8DF6F0A77CADC104F0762B95DE4F53F3948E8F22
[accentColor] => 92B516
)
[E61C698713BCFC1BDBAFF938735C3CC00A7CBFF5] => Array
(
[name] => BINARY SEARCH
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.VrXhOCdcCLiHZjXyLnFF1AHaCO?pid=Api
[datePublished] => 2020-08-04T08:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/BinarySearching2.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Binary-Search.htm
[contentSize] => 11539 B
[width] => 674
[height] => 203
[cDNContentUrl] => https://th.bing.com/th/id/R.56b5e138275c08b8876635f22e7145d4?rik=bsGWeDHLz7G9%2bg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FFBC7A00CC3C537839FFABDB1CFCB317896C16E
[accentColor] => 4B1303
)
[0BCE0540962E75870FC9FDA43A27E95DDCE5D60F] => Array
(
[name] => Minimum Number of Operations to Sort a Binary Tree by Level - DSA ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.AlApj3cegASxgBReu67ErAHaFE?pid=Api
[datePublished] => 2025-04-22T10:57:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2022/09/18/image-20220918174052-4.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/minimum-number-of-operations-to-sort-a-binary-tree-by-level
[contentSize] => 29765 B
[width] => 708
[height] => 485
[cDNContentUrl] => https://th.bing.com/th/id/R.0250298f771e8004b180145ebbaec4ac?rik=sOxQBGniV3jwnA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F06D5ECDD59E72A34ADF9CF07857E2690450ECB0
[accentColor] => 5A6A71
)
[EB63794CD1190F67A460B32B0AC9FAAD986EA484] => Array
(
[name] => Find Duplicate Subtrees - DSA Problem | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.b4ara5edbd4JmXiQxZxEXAHaE_?pid=Api
[datePublished] => 2025-04-26T01:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/08/16/e33.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/find-duplicate-subtrees
[contentSize] => 25798 B
[width] => 589
[height] => 397
[cDNContentUrl] => https://th.bing.com/th/id/R.6f86ab6b979d6dde09997890c59c445c?rik=vjaXxB2R8HZKBg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 484AE689DAAF9CA0B23B064A76F0911DC49736BE
[accentColor] => 7E534D
)
[01752C38D8222ED3A267021739A3B2A3D477C471] => Array
(
[name] => DSA Binary Search Tree(BST) - Binary Search Tree(BST) Binary search ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.2TRF0dP7TedIDPuTdP0jlwHaKe?pid=Api
[datePublished] => 2021-07-21T23:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/af643efbf6e89b8128a55ea337978c62/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/anna-university/computer-science/dsa-binary-search-treebst/9057467
[contentSize] => 517145 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.d93445d1d3fb4de7480cfb9374fd2397?rik=EFfCg40i4j0qdg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 174C774D3A2B3A937120762A3DE2228D83C25710
[accentColor] => 0B73C0
)
[884CB9E9151045E4BB0D09DBA30BE3E1BA1C8B1D] => Array
(
[name] => Depth-first and breadth-first search in Haskell
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.O0Ece5lWJWt1AKpuuGG3gAAAAA?pid=Api
[datePublished] => 2021-04-19T02:29:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://malv.in/images/xkcd-2407-depth_and_breadth.png
[hostPageUrl] => https://malv.in/posts/2021-01-09-depth-first-and-breadth-first-search-in-haskell.html
[contentSize] => 79514 B
[width] => 350
[height] => 449
[cDNContentUrl] => https://th.bing.com/th/id/R.3b411c7b9956256b7500aa6eb861b780?rik=iMSbnlEBVE670A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D1B8C1AB1E3EB03ABD90D0BB4E5401519E9BC488
[accentColor] => 363636
)
[BB6D1BCB65F77C5A6EAD06C3B265F821E2248D67] => Array
(
[name] => AVL Trees - Definition, Theorem, Algorithm with Example C Programs ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.FLCBF_ry3-G5tlsh4YK2ZgHaCl?pid=Api
[datePublished] => 2023-08-01T22:03:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.poriyaan.in/media/imgPori/images51/PKfRgrd.jpg
[hostPageUrl] => https://cse.poriyaan.in/topic/avl-trees-50539/
[contentSize] => 44062 B
[width] => 613
[height] => 214
[cDNContentUrl] => https://th.bing.com/th/id/R.14b08117faf2dfe1b9b65b21e182b666?rik=u9axvFZ%2fx6Xm2g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 76D8422E128F562B3C60DAE6A5C77F56BCB1D6BB
[accentColor] => 60636B
)
[753D2482EDB63F1EAAC97A8D223097F618DC436A] => Array
(
[name] => Algorithms: introduction to algorithms Thomas H.cormen q.22.2-3
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.5o8J6mL1OUaPb2qQvC4nIAHaEb?pid=Api
[datePublished] => 2017-10-19T13:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://gateoverflow.in/?qa=blob&qa_blobid=17871884588635617206
[hostPageUrl] => https://gateoverflow.in/82109/introduction-to-algorithms-thomas-h-cormen-q-22-2-3
[contentSize] => 25592 B
[width] => 600
[height] => 359
[cDNContentUrl] => https://th.bing.com/th/id/R.e68f09ea62f539468f6f6a90bc2e2720?rik=V9NCKN5r8%2bGqnA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A634CD816F790322D8A79CAAE1F36BDE2842D357
[accentColor] => 70695B
)
[72727DC64E89012DDE97E81ABD6247C88AEB2437] => Array
(
[name] => Chapter 5 -- Exception Handling in Java
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.IHQKwk6X90sf7bZhNUARhgAAAA?pid=Api
[datePublished] => 2019-07-30T01:42:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://cse.iitkgp.ac.in/~dsamanta/java/exception1.jpg
[hostPageUrl] => https://cse.iitkgp.ac.in/~dsamanta/java/ch5.htm
[contentSize] => 21294 B
[width] => 453
[height] => 227
[cDNContentUrl] => https://th.bing.com/th/id/R.20740ac24e97f74b1fedb66135401186?rik=JyfXbOSYENLteQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7342BEA88C7426DBA18E79EDD21098E46CD72727
[accentColor] => 796A52
)
[672E50E19F5280F0817B42323D46A7BF50EC3461] => Array
(
[name] => Binary Tree Tilt - DSA Problem | Talentd
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.lfib3ZoTPTRyWgMwFJNwWQHaEL?pid=Api
[datePublished] => 2025-04-20T17:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://backend.talentd.in/wp-content/uploads/dsa/dsa-corner-binary-tree-tilt.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/binary-tree-tilt
[contentSize] => 92709 B
[width] => 1640
[height] => 924
[cDNContentUrl] => https://th.bing.com/th/id/R.95f89bdd9a133d34725a033014937059?rik=duIFHvklCA8Ytw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1643CE05FB7A64D32324B7180F0825F91E05E276
[accentColor] => 24A75B
)
[025BFF133DEF15C91C3E55D85FA7F925F122133C] => Array
(
[name] => AVL TREE - good - THREADED BINARY TREEs A threaded binary tree is the ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.nk1dXXdVqyoWbQaWqjwviQHaKe?pid=Api
[datePublished] => 2023-02-20T09:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/f6d979415ab06ed6aa8769a817d3824d/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/university-of-madras/advance-java/avl-tree-good/40658520
[contentSize] => 469559 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.9e4d5d5d7755ab2a166d0696aa3c2f89?rik=ILX%2fMdP%2bUZzB4w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C331221F529F7AF58D55E3C19C51FED331FFB520
[accentColor] => 5B6570
)
[D367A2E2C877B2F0BBF77A9A9CF92BA35F5C3F0B] => Array
(
[name] => Delete Node In Binary Search Tree -C#
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.41O4q2o5mVSBn1PbBma-2gHaFE?pid=Api
[datePublished] => 2021-06-05T11:14:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://1.bp.blogspot.com/-K2iXLnj6AnA/YLhtRapJ0ZI/AAAAAAAAOvI/YEOzeRc2KrwhQ241x_xWx-RL37uHP9mfACLcBGAsYHQ/w1600/no_c.gif
[hostPageUrl] => https://www.codeguru.co.in/2021/06/delete-node-in-binary-search-tree-c.html
[contentSize] => 25265 B
[width] => 1054
[height] => 722
[proxyContentUrl] => https://tse1.mm.bing.net/th/id/OGC.e353b8ab6a399954819f53db0666beda?pid=Api&rurl=https%3a%2f%2f1.bp.blogspot.com%2f-K2iXLnj6AnA%2fYLhtRapJ0ZI%2fAAAAAAAAOvI%2fYEOzeRc2KrwhQ241x_xWx-RL37uHP9mfACLcBGAsYHQ%2fw1600%2fno_c.gif&ehk=piegWbUV28PJZk8CeGD16Xq3LbYiKEBkizcoN9Liy%2f8%3d
[cDNContentUrl] => https://th.bing.com/th/id/R.e353b8ab6a399954819f53db0666beda?rik=PXYqLox3Kw%2b7fw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B0F3C5F53AB29FC9A9A77FBB0F2B778C2E2A763D
[accentColor] => 8D271F
)
[9A255B9143BAF1AF38B3FA1A0809F0EF898A8269] => Array
(
[name] => Univalued Binary Tree - DSA Problem | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.UimrGJlLbqiHal1u91PLFAAAAA?pid=Api
[datePublished] => 2025-04-21T18:39:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2018/12/28/unival_bst_1.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/univalued-binary-tree
[contentSize] => 6961 B
[width] => 265
[height] => 172
[cDNContentUrl] => https://th.bing.com/th/id/R.5229ab18994b6ea8876a5d6ef753cb14?rik=qVK1GTSrH%2fqDOw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9628A898FE0F9080A1AF3B83FA1FAB3419B552A9
[accentColor] => 516D7A
)
[C8959E7357A8B1ED59FD1B7122853C644B768EE7] => Array
(
[name] => Дерево Меркла — Teletype
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.PBvfjS0XJeWAjjBXfiE16gHaDt?pid=Api
[datePublished] => 2022-11-08T21:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://media.geeksforgeeks.org/wp-content/cdn-uploads/MerkleTree-min-1024x512.png
[hostPageUrl] => https://teletype.in/@ortomich/Merkle_Tree
[contentSize] => 192691 B
[width] => 1024
[height] => 512
[cDNContentUrl] => https://th.bing.com/th/id/R.3c1bdf8d2d1725e5808e30577e2135ea?rik=jFnpN3WKG96V3w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 7EE867B446C3582217B1DF95DE1B8A7537E9598C
[accentColor] => 379442
)
[CD9C9578DD39A79E521A4AE401C9EA11358ABD51] => Array
(
[name] => 515. Find Largest Value in Each Tree Row - Medium | DSA Corner | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.L9NEV087NnT5kQA3tAUd-QHaEP?pid=Api
[datePublished] => 2025-03-07T14:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/find-largest-value-in-each-tree-row
[contentSize] => 18493 B
[width] => 562
[height] => 322
[cDNContentUrl] => https://th.bing.com/th/id/R.2fd344574f3b3674f9910037b4051df9?rik=3MlZh92TeukloQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 15DBA85311AE9C104EA4A125E97A93DD8759C9DC
[accentColor] => 41608A
)
[CC67BC6A87320BD49F0C61D0CD8026564AAC8590] => Array
(
[name] => U2 multiplication near base - Programming in java - Studocu
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.rzkmZE_WxZR_vwZRJuwUswHaPK?pid=Api
[datePublished] => 2021-05-02T04:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/028d2b52e19fc3e4b04e6fa87a0f3c27/thumb_1200_2457.png
[hostPageUrl] => https://www.studocu.com/in/document/lovely-professional-university/programming-in-java/u2-multiplication-near-base/12130855
[contentSize] => 590241 B
[width] => 1200
[height] => 2457
[cDNContentUrl] => https://th.bing.com/th/id/R.af3926644fd6c5947fbf065126ec14b3?rik=zHbLpngjsE35wA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0958CAA4656208DC0D16C0F94DB02378A6CB76CC
[accentColor] => 202020
)
[196BB02DF80D82D69DA0AE45072094EB2392841A] => Array
(
[name] => Second Minimum Node In a Binary Tree - DSA Problem | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.52ZQuScygrzGY5eVNJLlDQAAAA?pid=Api
[datePublished] => 2025-04-22T02:57:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/10/15/smbt2.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/second-minimum-node-in-a-binary-tree
[contentSize] => 7145 B
[width] => 321
[height] => 182
[cDNContentUrl] => https://th.bing.com/th/id/R.e76650b9273282bcc66397953492e50d?rik=kbYL0o%2fQKG3ZCg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A1482932BE49027054EA0AD96D28D08FD20BB691
[accentColor] => 666666
)
[6FDC17D7E7511F5EA77D603AEAA29053388C2DD0] => Array
(
[name] => Binary Code Presentation Years 3-6 Digital Technologies
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.8ckHBI4LrRMZnmqdkXpBGgHaDt?pid=Api
[datePublished] => 2022-07-08T18:42:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://images.twinkl.co.uk/tw1n/image/private/t_630_eco/image_repo/b1/5e/au-st-1652355336-binary-code-presentation-years-3-6_ver_1.png
[hostPageUrl] => https://www.twinkl.co.in/resource/binary-code-powerpoint-3-6-au-st-1652355336
[contentSize] => 70838 B
[width] => 630
[height] => 315
[cDNContentUrl] => https://th.bing.com/th/id/R.f1c907048e0bad13199e6a9d917a411a?rik=9s1xfX4V8eV61w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 0DD2C88335092AAEA306D77AE5F1157E7D71CDF6
[accentColor] => 038FC8
)
[6149ACF2BDB28BEAB73E9558DC4FF6F2C363E7D2] => Array
(
[name] => 1080. Insufficient Nodes in Root to Leaf Paths - Medium | DSA Corner ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.-57MCmUp4qdieYXxYyeyMgHaFE?pid=Api
[datePublished] => 2025-03-16T05:20:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2019/06/05/insufficient-3.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/insufficient-nodes-in-root-to-leaf-paths
[contentSize] => 55096 B
[width] => 706
[height] => 484
[cDNContentUrl] => https://th.bing.com/th/id/R.fb9ecc0a6529e2a7627985f16327b232?rik=FpTKL9sruK574w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2D7E363C2F6FF4CD8559E37BAEB82BDB2FCA9416
[accentColor] => 448888
)
[4D916B1E3E7EA8A4072DEB19F27153D1010770DC] => Array
(
[name] => Binary tree traversals - Data Structures Tutorial | Study Glance
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.WobjAZiEmpNN-8JhldmzJgHaCx?pid=Api
[datePublished] => 2023-11-19T16:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://studyglance.in/images/logo4.png
[hostPageUrl] => https://studyglance.in/ds/display.php?tno=24&topic=Binary-tree-traversals
[contentSize] => 162211 B
[width] => 2559
[height] => 960
[cDNContentUrl] => https://th.bing.com/th/id/R.5a86e30198849a934dfbc26195d9b326?rik=1Bm24ePnikpw0g&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => CD0770101D35172F91BED2704A8AE7E3E1B619D4
[accentColor] => C78404
)
[34D7ECB9F3625DE1AE12A41179E913C98DE54021] => Array
(
[name] => 968. Binary Tree Cameras - Hard | DSA Corner | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.nshFqbssf3PLNIiVO1bKygAAAA?pid=Api
[datePublished] => 2025-04-20T17:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_01.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/binary-tree-cameras
[contentSize] => 7426 B
[width] => 138
[height] => 163
[cDNContentUrl] => https://th.bing.com/th/id/R.9ec845a9bb2c7f73cb3488953b56caca?rik=Q33Omz8m1R7qIQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 12045ED89C319E97114A21EA1ED5263F9BCE7D43
[accentColor] => 448888
)
[5C3B16518DED9AC73A20A41179E913C98DE54021] => Array
(
[name] => 968. Binary Tree Cameras - Hard | DSA Corner | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.7Rk0MOyKeyBHVxzO11ZcSgAAAA?pid=Api
[datePublished] => 2025-04-20T17:58:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_02.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/binary-tree-cameras
[contentSize] => 10614 B
[width] => 139
[height] => 312
[cDNContentUrl] => https://th.bing.com/th/id/R.ed193430ec8a7b2047571cced7565c4a?rik=xbNhFdjeqXyjAg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 12045ED89C319E97114A02A37CA9DED81561B3C5
[accentColor] => 444488
)
[57F9CFFAFFD873F07A71E3903406E81864533A82] => Array
(
[name] => Sum of Nodes with Even-Valued Grandparent - DSA Problem | Talentd
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.1og99H2yt0fdUvsAdxK2DQHaEc?pid=Api
[datePublished] => 2025-04-25T21:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/08/10/even1-tree.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/sum-of-nodes-with-even-valued-grandparent
[contentSize] => 26307 B
[width] => 504
[height] => 302
[cDNContentUrl] => https://th.bing.com/th/id/R.d6883df47db2b747dd52fb007712b60d?rik=dZ%2f8r%2f%2bNNw%2bnFw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 28A33546818E6043093E17A70F378DFFAFFC9F75
[accentColor] => 0044CB
)
[7A170EBEAEEE0BD60DE5C04A7D3A73B8D900CC20] => Array
(
[name] => Searching Strategies : Breadth First Search
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.fuKtzbeBLqPiHYVWAo0j2gHaKe?pid=Api
[datePublished] => 2020-12-12T18:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://minigranth.in/images/tutorials/AI%20IMAGES/BFS.jpg
[hostPageUrl] => https://minigranth.in/artificial-intelligence-tutorial/searching-strategies-in-ai
[contentSize] => 179039 B
[width] => 1240
[height] => 1754
[cDNContentUrl] => https://th.bing.com/th/id/R.7ee2adcdb7812ea3e21d8556028d23da?rik=p3Hg6%2brusG3QXg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 02CC009D8B37A3D7A40C5ED06DB0EEEAEBE071A7
[accentColor] => 434343
)
[55682BE16F5FC52AC402E531A36444706D5CB333] => Array
(
[name] => In the binary equation ( 1p101)2+ (10q1)2= (100r100)2Where p, q and r ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.jt9Gx7fip2khCpfAWhafvgAAAA?pid=Api
[datePublished] => 2024-03-12T04:47:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/6008e824-b275-4acc-87a2-5ce234d86ddd_lg.png
[hostPageUrl] => https://edurev.in/question/4600031/In-the-binary-equation---1p101-2--10q1-2--100r100-2Where-p--q-and-r-are-binary-digits--what-are-the-
[contentSize] => 4152 B
[width] => 245
[height] => 210
[cDNContentUrl] => https://th.bing.com/th/id/R.8edf46c7b7e2a769210a97c05a169fbe?rik=VYayHvb1XKJMIA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 333BC5D60744463A135E204CA25CF5F61EB28655
[accentColor] => 666666
)
[B51533DA68AC2C0A1AF45141F37A6D85546629B9] => Array
(
[name] => Binary Search Algorithm Example in Java | DSA
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.ENm0nzS9UMxdwsEgIOxnJgHaCs?pid=Api
[datePublished] => 2025-08-30T13:13:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://smartprogramming.in/tutorials/dsa-using-java/images/binary-search-algorithm-in-java-dsa.jpg
[hostPageUrl] => https://smartprogramming.in/tutorials/dsa-using-java/binary-search-algorithm-example
[contentSize] => 144864 B
[width] => 1622
[height] => 590
[cDNContentUrl] => https://th.bing.com/th/id/R.10d9b49f34bd50cc5dc2c12020ec6726?rik=W1EzrYbKwqChTw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9B92664558D6A73F14154FA1A0C2CA86AD33515B
[accentColor] => AA2121
)
[B8BEFFCF29FD8A9107C05DD90DCCC5A9397DD092] => Array
(
[name] => A Search Algorithm Puzzle: Finding a Bad Coin - /usr/sbin/blog
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.HdLmnlx3R-70SONnUFLOXgHaFk?pid=Api
[datePublished] => 2025-03-28T22:30:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://media.usrsb.in/bad-coin/dectree.png
[hostPageUrl] => https://www.usrsb.in/blog/blog/2011/08/17/a-search-algorithm-puzzle-finding-a-bad-coin/
[contentSize] => 48520 B
[width] => 1366
[height] => 1026
[cDNContentUrl] => https://th.bing.com/th/id/R.1dd2e69e5c7747eef448e3675052ce5e?rik=i%2bv%2f%2fJLfqBlwDA&riu=http%3a%2f%2fmedia.usrsb.in%2fbad-coin%2fdectree.png&ehk=qfvwbOk4SGLQ%2ffelz%2bprqJ6ln7Uzsj1MGXfu6pPgLQ8%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 290DD7939A5CCCD09DD50C7019A8DF92FCFFEB8B
[accentColor] => 202020
)
[BE2A2EBD8924B6B5B62D913BE1A3A03D6CA881B1] => Array
(
[name] => Multi-Level Knowledge-Aware Contrastive Learning Network for ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.Gqp8kuKxCkU8Wxkqu8oTEwHaDL?pid=Api
[datePublished] => 2022-12-14T15:30:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://pub.mdpi-res.com/applsci/applsci-12-12863/article_deploy/html/images/applsci-12-12863-g001.png?1671536891
[hostPageUrl] => https://www.mdpi.com/2076-3417/12/24/12863
[contentSize] => 1146278 B
[width] => 3974
[height] => 1706
[cDNContentUrl] => https://th.bing.com/th/id/R.1aaa7c92e2b10a453c5b192abbca1313?rik=66Li25hCa1tr0g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 1B188AC6D30A3A1EB319D26B5B6B4298DBE2A2EB
[accentColor] => B49017
)
[0FF21CDBBC095794CCA01F2426EF91AA669DAA0A] => Array
(
[name] => Quick Sort | Ujjwalit
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.XrsVSTkt6I9XDvvK4JuQeQHaDt?pid=Api
[datePublished] => 2025-04-29T09:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://media.geeksforgeeks.org/wp-content/uploads/20240926172924/Heap-Sort-Recursive-Illustration.webp
[hostPageUrl] => https://www.ujjwalit.co.in/blogs/6803ca6eed98f38ab4d56803
[contentSize] => 22980 B
[width] => 801
[height] => 401
[cDNContentUrl] => https://th.bing.com/th/id/R.5ebb1549392de88f570efbcae09b9079?rik=8C%2fBvcuQdUnMCg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A0AAD966AA19FE6242F10ACC497590CBBDC12FF0
[accentColor] => 4E7D6E
)
[F77C61B884B410F6F9FDC4B31FF470AF16C4530E] => Array
(
[name] => Object-Oriented Programming (OOP) with Java - ② ♠r r s ♥ r s ② ♣♦ ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.GQ3mqSFFPVI75UC-c1AOEgHaJl?pid=Api
[datePublished] => 2023-06-18T23:21:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/9db96e980fc2b15e81427bdafb17e9a5/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/adithya-institute-of-technology/computer-networks/object-oriented-programming-oop-with-java/55008871
[contentSize] => 265087 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.190de6a921453d523be540be73500e12?rik=f8cWi0hLAW%2bf3w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => E0354C61FA074FF13B4CDF9F6F014B488B16C77F
[accentColor] => 424242
)
[8F058530F8FD0CA802F1CEE50B12E275ED774EAC] => Array
(
[name] => SATHEE: Chapter 04 Forest Society and Colonialism
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.V4VawYg-jKslXXWUKLYITAHaER?pid=Api
[datePublished] => 2025-06-23T11:40:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://temp-public-img-folder.s3.amazonaws.com/sathee.prutor.images/sathee_image/https___cdn_mathpix_com_cropped_2024_01_22_ed21c933942a98e4e90dg-457_jpg_height_626_width_1086_top_left_y_1815_top_left_x_89.jpg
[hostPageUrl] => https://sathee.iitk.ac.in/ncert-books/class-09/social-science/india-and-the-contemporary-world-1/chapter-04-forest-society-and-colonialism/
[contentSize] => 112491 B
[width] => 1086
[height] => 626
[cDNContentUrl] => https://th.bing.com/th/id/R.57855ac1883e8cab255d759428b6084c?rik=%2bFBYA4%2ffwIogHw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => CAE477DE572E21B05EEC1F208AC0DF8F035850F8
[accentColor] => 575456
)
[3F57A06A98E99A50EF542AA7FEB46C6A8E3A6234] => Array
(
[name] => PRIM's ALGORITHM - MINIMUM SPANNING TREE - IMPLEMENTATION
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.-g8WnINqpJvmy6zpuaSo8QHaIK?pid=Api
[datePublished] => 2020-09-17T18:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/PrimsImplementation11.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Prim's-Algorithm-Minimum-Spanning-Tree-Implementation.htm
[contentSize] => 76448 B
[width] => 660
[height] => 727
[cDNContentUrl] => https://th.bing.com/th/id/R.fa0f169c836aa49be6cbace9b9a4a8f1?rik=83UKpomeqQX%2bRQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4326A3E8A6C64BEF7AA245FE05A99E89A60A75F3
[accentColor] => C63A05
)
[C5B577A6C6DA2927573F56A4887CA003ADFF2CA2] => Array
(
[name] => How to Use Trees
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.kf6KK-3qfn2UiP5VahrofgHaDy?pid=Api
[datePublished] => 2019-11-23T05:46:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.iitk.ac.in/esc101/05Aug/tutorial/figures/uiswing/components/TreeDemo.gif
[hostPageUrl] => https://www.iitk.ac.in/esc101/05Aug/tutorial/uiswing/components/tree.html
[contentSize] => 6920 B
[width] => 511
[height] => 261
[cDNContentUrl] => https://th.bing.com/th/id/R.91fe8a2bedea7e7d9488fe556a1ae87e?rik=XFt3amytknJ18w&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2AC2FFDA300AC7884A65F3757292AD6C6A775B5C
[accentColor] => 495382
)
[222C10D28A31437CFB32A9FE3C7F2D0DB6BA2D69] => Array
(
[name] => 100. Same Tree - Easy | DSA Corner | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.iwaGnMRM3NQdP6m_GkJIfgAAAA?pid=Api
[datePublished] => 2025-03-09T07:52:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/same-tree
[contentSize] => 8285 B
[width] => 382
[height] => 182
[cDNContentUrl] => https://th.bing.com/th/id/R.8b06869cc44cdcd41d3fa9bf1a42487e?rik=IsIBLagTNMe%2fIw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 96D2AB6BD0D2F7C3EF9A23BFC73413A82D01C222
[accentColor] => 666666
)
[59ED5DA39C6259E504D98715CE7909B4250E04F2] => Array
(
[name] => Kami Export - PCT2 Revision List - 1 Motion, forces and energy You ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.sdC-oOrhUxQ2xKQQAUJomwHaFP?pid=Api
[datePublished] => 2024-07-28T16:23:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/5008ab76f7cdfd0763d1af2697165fec/thumb_1200_849.png
[hostPageUrl] => https://www.studocu.com/in/document/puducherry-technological-university/data-structures/kami-export-pct2-revision-list/94473781
[contentSize] => 159549 B
[width] => 1200
[height] => 849
[cDNContentUrl] => https://th.bing.com/th/id/R.b1d0bea0eae1531436c4a4100142689b?rik=ld7VOskmlV5AnQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 2F40E0524B9097EC51789D405E9526C93AD5DE95
[accentColor] => C98E02
)
[443A04A9DE274E6139AD7C8AE3444F777675669A] => Array
(
[name] => Binary Search Tree | Web Technology Experts Notes
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.6M3pfgxzvv_IDJN7l1z_oAAAAA?pid=Api
[datePublished] => 2018-01-03T13:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://4.bp.blogspot.com/-mKEkbylYkts/UamQnu5Y4aI/AAAAAAAAAJg/vqfrXF63oiA/s1600/Binary+Tree+Logo.png
[hostPageUrl] => https://www.web-technology-experts-notes.in/2013/06/binary-search-tree.html
[contentSize] => 9594 B
[width] => 201
[height] => 171
[cDNContentUrl] => https://th.bing.com/th/id/R.e8cde97e0c73beffc80c937b975cffa0?rik=RKNAmu1y5BaT2g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => A966576777F4443EA8C7DA9316E472ED9A40A344
[accentColor] => 666666
)
[96C8DEB4BFD487EAF2C3DBBE055395D6B3CFEAD3] => Array
(
[name] => Linear Search
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.CNzxpzJp7LVOyvrClw1bxgHaEK?pid=Api
[datePublished] => 2021-03-21T21:27:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://1.bp.blogspot.com/-2IH36gRCTVI/YFcpvnOcHJI/AAAAAAAALvk/ieJ-gZYh6hYMxvRDbiCsuv2655mGOF5uQCNcBGAsYHQ/w1600/linearSearch.png
[hostPageUrl] => https://www.codeamy.in/2021/03/linear-search.html
[contentSize] => 96502 B
[width] => 1600
[height] => 900
[cDNContentUrl] => https://th.bing.com/th/id/R.08dcf1a73269ecb54ecafac2970d5bc6?rik=aYztS%2ftNeK4vPA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3DAEFC3B6D593550EBBD3C2FAE784DFB4BED8C69
[accentColor] => 088849
)
[0CAD8E4CEF8445CA18DCE3903406E81864533A82] => Array
(
[name] => Sum of Nodes with Even-Valued Grandparent - DSA Problem | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.GEiBb5EmhmuBA-alzeXyfwAAAA?pid=Api
[datePublished] => 2025-04-25T21:48:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/08/10/even2-tree.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/sum-of-nodes-with-even-valued-grandparent
[contentSize] => 2332 B
[width] => 64
[height] => 65
[cDNContentUrl] => https://th.bing.com/th/id/R.1848816f9126866b8103e6a5cde5f27f?rik=wNroxP5IVKyBzQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 28A33546818E6043093ECD81AC5448FEC4E8DAC0
[accentColor] => 666666
)
[03E93CC98F85317A24FD3E6BCE007213E2B0970F] => Array
(
[name] => JAVA – Innovative Codes Academy
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.QvpDijXb48OWzbZhfflKCwHaE8?pid=Api
[datePublished] => 2022-08-14T13:45:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://www.innovativecodesacademy.in/wp-content/uploads/2021/02/239302-1600x1067-mighty-oak-1536x1024.jpg
[hostPageUrl] => http://www.innovativecodesacademy.in/java/
[contentSize] => 398706 B
[width] => 1536
[height] => 1024
[cDNContentUrl] => https://th.bing.com/th/id/R.42fa438a35dbe3c396cdb6617df94a0b?rik=MJ7DnPhYE6dC3w&riu=http%3a%2f%2fwww.innovativecodesacademy.in%2fwp-content%2fuploads%2f2021%2f02%2f239302-1600x1067-mighty-oak-1536x1024.jpg&ehk=mgHGqtfTUheu41HUD%2f2QclysEuDEfOVNbjyqOcs354Q%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => F0790B2E312700ECB6E3DF42A71358F89CC39E30
[accentColor] => 3D3A1A
)
[CB6CB635091D5F746021263B4F9142DD26AE9C32] => Array
(
[name] => The ML Hub
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.i90O27gOluY4xpJA879ukQHaEK?pid=Api
[datePublished] => 2024-05-20T12:06:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://appxcontent.kaxa.in/paid_course3/2024-06-12-0.7196540566182834.png
[hostPageUrl] => https://web.ravindrababuravula.in/new-courses/28-dsa-in-python
[contentSize] => 901268 B
[width] => 1280
[height] => 720
[cDNContentUrl] => https://th.bing.com/th/id/R.8bdd0edbb80e96e638c69240f3bf6e91?rik=vMZrU5DR9UcGEg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 23C9EA62DD2419F4B362120647F5D190536BC6BC
[accentColor] => CCC100
)
[B2820A63DF56541B7AC1083BB6C9C0960432EF67] => Array
(
[name] => DANIEL YARDS Blue Java Banana Seeds - 100pcs - Sweet & Nutritious India ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.PEdVPvmJ9sudpGdL8i0FlwHaHa?pid=Api
[datePublished] => 2023-07-29T20:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://images-cdn.ubuy.co.in/647b3de35c8d5c532d18273a-blue-java-banana-seeds-100pcs-the-ice.jpg
[hostPageUrl] => https://www.ubuy.co.in/product/4SY6965CG-blue-java-banana-seeds-100pcs-the-ice-cream-banana-tree-plant-sweet-high-nutrition-fruit-seeds
[contentSize] => 77222 B
[width] => 750
[height] => 750
[cDNContentUrl] => https://th.bing.com/th/id/R.3c47553ef989f6cb9da4674bf22d0597?rik=KyigNv1lRbGnHA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 76FE2340690C9C6BB3801CA7B14565FD36A0282B
[accentColor] => 2F8D9C
)
[1FF5F956DE66B7E30833F46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.6VBqX5R3Z1E2BzmxHeerkgAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Sujal.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 15826 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.e9506a5f94776751360739b11de7ab92?rik=8V%2bfZe1mez6AMw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064F33803E7B66ED659F5FF1
[accentColor] => 9C2F43
)
[EE6625C2A397ACD69068C6506EFFB7A698A6CDC9] => Array
(
[name] => Java Downloads - Tools and Resources | Oracle India
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.uyelsTMOtnIzo2UQgi5HCwHaEE?pid=Api
[datePublished] => 2022-10-31T19:30:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oracle.com/a/tech/img/rc10-java-badge-3.png
[hostPageUrl] => https://www.oracle.com/in/java/technologies/downloads/tools/
[contentSize] => 15926 B
[width] => 545
[height] => 300
[cDNContentUrl] => https://th.bing.com/th/id/R.bb27a5b1330eb67233a36510822e470b?rik=7mZSLDp5ym0Jhg&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 9CDC6A896A7BFFE6056C86096DCA793A2C5266EE
[accentColor] => B86C13
)
[F1DB0E21DEC1EE763C0E6212BDF5F3DE15932A48] => Array
(
[name] => R introduction - ⇧ SCROLL TO TOP Home Java R C Kotlin C++ C# ADO Ruby ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.JMrPNH9md5P5Nx746lf6egHaKe?pid=Api
[datePublished] => 2023-03-26T11:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/04e81e93b15e799dcc3ea7c4596751fb/thumb_1200_1698.png
[hostPageUrl] => https://www.studocu.com/in/document/jawaharlal-nehru-technological-university-anantapur/computer-science-engineering/r-introduction/50530745
[contentSize] => 17600 B
[width] => 1200
[height] => 1698
[cDNContentUrl] => https://th.bing.com/th/id/R.24cacf347f667793f9371ef8ea57fa7a?rik=H73gEu0c7mfD4A&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 84A23951ED3F5FDB2126E0C367EE1CED12E0BD1F
[accentColor] => 666666
)
[9DB28BE9808FF1F3BA75F46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.GkJabM9SF-TOlX9-S-lffAAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Kush.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 18308 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.1a425a6ccf5217e4ce957f7e4be95f7c?rik=2Su4ngj4Hz%2brVw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064F57AB3F1FF8089EB82BD9
[accentColor] => 215A50
)
[2262ED95DA618C97C9ECFDA8DA3B832F8F768E34] => Array
(
[name] => Deepest Leaves Sum - DSA Problem | Talentd
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.WTYTZaZY05G0fo0LsHVL1AAAAA?pid=Api
[datePublished] => 2025-04-26T16:18:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2019/07/31/1483_ex1.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/deepest-leaves-sum
[contentSize] => 16549 B
[width] => 273
[height] => 265
[cDNContentUrl] => https://th.bing.com/th/id/R.59361365a658d391b47e8d0bb0754bd4?rik=IibeWa0WyHmczg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 43E867F8F238B3AD8ADFCE9C79C816AD59DE2622
[accentColor] => 7F9239
)
[AD0F5E6D14F00C758E77F46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.rcDVRkOy3PiKXJMXPnDElgAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Amrita.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 17440 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.adc0d54643b2dcf88a5c93173e70c496?rik=2vDl1kEPwFfodw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064F77E857C00F41D6E5F0DA
[accentColor] => 31666B
)
[363379A1285BA9B6E2BF1FC2A11B15B42C7C0223] => Array
(
[name] => Blue Java Banana / Musa accuminata - Fruits plant & Tree– Exotic Flora
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.U0r5-9D--nGckNqIi61DVwHaHa?pid=Api
[datePublished] => 2024-03-06T12:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://exoticflora.in/cdn/shop/files/4_1024x1024.png?v=1709276504
[hostPageUrl] => https://exoticflora.in/products/blue-java-musa-accuminata-fruits-plant-tree
[contentSize] => 1514273 B
[width] => 1024
[height] => 1024
[cDNContentUrl] => https://th.bing.com/th/id/R.534af9fbd0fefa719c90da888bad4357?rik=YzOXGoK1mmsu%2bw&riu=http%3a%2f%2fexoticflora.in%2fcdn%2fshop%2ffiles%2f4_1024x1024.png%3fv%3d1709276504&ehk=B9Wbrb%2f9oBLtWh%2fYnfb0dBt3ZpKWmzzuzJBLxCY5qU8%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3220C7C24B51B11A2CF1FB2E6B9AB5821A973363
[accentColor] => 0C4C61
)
[7652C74E801829452A6FF46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.x8937gx6hhquYGBwGfbWeQAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Ayush-Panuily.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 12922 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.c7cf77ee0c7a861aae60607019f6d679?rik=ZyV85AiBklSi9g&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064FF6A254928108E47C2567
[accentColor] => 4C4685
)
[F587BEEA3F398E83BE2AF24021300B58D7655EF3] => Array
(
[name] => what are the difference between Binary fission and Budding? - Brainly.in
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.Af8wjk6gWQQJ9DqEhYLpLwHaK7?pid=Api
[datePublished] => 2019-12-15T03:56:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/def/3bee72d357d48f13f8366e3e4429b93a.jpg
[hostPageUrl] => https://brainly.in/question/14120947
[contentSize] => 65582 B
[width] => 628
[height] => 927
[cDNContentUrl] => https://th.bing.com/th/id/R.01ff308e4ea0590409f43a848582e92f?rik=X3jrrvOT6Djrog&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3FE5567D85B00312042FA2EB38E893F3AEEB785F
[accentColor] => 0D7651
)
[E7D0FA25477A5A7FC7301FC2A11B15B42C7C0223] => Array
(
[name] => Blue Java Banana / Musa accuminata - Fruits plant & Tree– Exotic Flora
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.zo3hTAFhQs328-iXz4Mj8gHaHa?pid=Api
[datePublished] => 2024-03-06T12:36:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://exoticflora.in/cdn/shop/files/5_1024x1024.png?v=1709276503
[hostPageUrl] => https://exoticflora.in/products/blue-java-musa-accuminata-fruits-plant-tree
[contentSize] => 1355227 B
[width] => 1024
[height] => 1024
[cDNContentUrl] => https://th.bing.com/th/id/R.ce8de14c016142cdf6f3e897cf8323f2?rik=fg2vUnSnpfd8Aw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 3220C7C24B51B11A2CF1037CF7A5A77452AF0D7E
[accentColor] => 27505B
)
[8F55E0E5768B80A1939D6F3C22738B35590209DA] => Array
(
[name] => Binary Code Nedir? Binary Code Ne Demek, Anlamı ve Tanımı
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.VLkSK1WOeYPnLZfSw9qI6wHaDD?pid=Api
[datePublished] => 2019-03-23T15:31:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.msxlabs.org/forum/attachments/68504d1553344745-binary-code-nedir-utf8-table-7802.png
[hostPageUrl] => https://www.msxlabs.org/forum/x-sozluk/510164-binary-code-nedir.html
[contentSize] => 199256 B
[width] => 780
[height] => 321
[cDNContentUrl] => https://th.bing.com/th/id/R.54b9122b558e7983e72d97d2c3da88eb?rik=%2bFUOXme4CBo52Q&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AD90209553B83722C3F6D9391A08B8675E0E55F8
[accentColor] => 109545
)
[76552083A6B18854A838F46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.Le79gyT9Bdq6-gGVkVbIKQAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Kashish.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 9882 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.2deefd8324fd05dabafa01959156c829?rik=Z1UCOGobiEWKgw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064F838A45881B6A38025567
[accentColor] => 8D773E
)
[6BD9F472D7A012F7CB64F46054EEC1C5E27DD3F5] => Array
(
[name] => DSA Course – Learn Data Structures & Algorithms– 2 Months
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.2z94zpTwhRhjcG122ZEIrAAAAA?pid=Api
[datePublished] => 2024-05-16T17:35:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oxfordinstitute.in/photo/video-reviews/Vashu-Wadhva.webp
[hostPageUrl] => https://oxfordinstitute.in/dsa-course.php
[contentSize] => 10214 B
[width] => 422
[height] => 422
[cDNContentUrl] => https://th.bing.com/th/id/R.db3f78ce94f0851863706d76d99108ac?rik=tp1PJ30KIX%2b8Rg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5F3DD72E5C1CEE45064F46BC7F210A7D274F9DB6
[accentColor] => 6B6062
)
[9ADB870D39E4E97EFE5A90CE5C7F038E1E78E05C] => Array
(
[name] => 2049. Count Nodes With the Highest Score - Medium | DSA Corner | Talentd
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.R2d0zmj_4wpCvl6SOI9h2AAAAA?pid=Api
[datePublished] => 2025-03-06T03:52:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/10/03/example-2.png
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/count-nodes-with-the-highest-score
[contentSize] => 2426 B
[width] => 95
[height] => 143
[cDNContentUrl] => https://th.bing.com/th/id/R.476774ce68ffe30a42be5e92388f61d8?rik=qb140JNOnufvpQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C50E87E1E830F7C5EC09A5EFE79E4E93D078BDA9
[accentColor] => A86E23
)
[8B79D3D05B21D872C0DAA2D46B3FD5906C938D6C] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.eST-Nbp8Is5Gfv1QTM6T1wAAAA?pid=Api
[datePublished] => 2021-03-23T09:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/assets/images/vlabs-color-small-moe.jpg
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/reconstructing-binary-tree/from-inorder-and-postorder.html
[contentSize] => 32248 B
[width] => 138
[height] => 77
[cDNContentUrl] => https://th.bing.com/th/id/R.7924fe35ba7c22ce467efd504cce93d7?rik=uJc9DbUSjScMrQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => C6D839C6095DF3B64D2AAD0C278D12B50D3D97B8
[accentColor] => 16699C
)
[9763694E671CF3D48B708765EA42F3ED059FAA77] => Array
(
[name] => RK Seeds - Sterculia foetida seeds Ornamental flower seeds Java Olive ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.CnWQAq4YCSUMjAtcQYCTzQHaE8?pid=Api
[datePublished] => 2020-09-25T01:02:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/81GS+Z7XoQL.jpg
[hostPageUrl] => https://www.amazon.in/RK-Seeds-Sterculia-Ornamental-sterculia/dp/B07PV51NK1
[contentSize] => 335452 B
[width] => 2560
[height] => 1707
[cDNContentUrl] => https://th.bing.com/th/id/R.0a759002ae1809250c8c0b5c418093cd?rik=eTaW5HbBP024Bw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 77AAF950DE3F24AE567807B84D3FC176E4963679
[accentColor] => 51309B
)
[50D51E350D9C2F1C04EB2AA7FEB46C6A8E3A6234] => Array
(
[name] => PRIM's ALGORITHM - MINIMUM SPANNING TREE - IMPLEMENTATION
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.zE_ihPdSLVrEQJUZ4A3NiwHaCp?pid=Api
[datePublished] => 2020-09-17T18:37:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Images/PrimsImplementation5.png
[hostPageUrl] => https://www.learnerslesson.com/Data-Structures-and-Algorithms/Prim's-Algorithm-Minimum-Spanning-Tree-Implementation.htm
[contentSize] => 13010 B
[width] => 960
[height] => 343
[cDNContentUrl] => https://th.bing.com/th/id/R.cc4fe284f7522d5ac4409519e00dcd8b?rik=BV3hU9DJ8sFAvg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 4326A3E8A6C64BEF7AA2BE40C1F2C9D053E15D05
[accentColor] => CC3300
)
[737AAE1B2311F8BDCB78F145E038BB093DE21701] => Array
(
[name] => Java Software | Oracle India
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.ZOwN_l8Md9kcmeI439SIcAHaD6?pid=Api
[datePublished] => 2016-05-06T11:01:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.oracle.com/a/ocom/img/rh03-oracle-java-r1.png
[hostPageUrl] => https://www.oracle.com/in/java/
[contentSize] => 36470 B
[width] => 815
[height] => 430
[cDNContentUrl] => https://th.bing.com/th/id/R.64ec0dfe5f0c77d91c99e238dfd48870?rik=N6fqsTIRj9u8hw&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 10712ED390BB830E541F87BCDB8F1132B1EAA737
[accentColor] => 40678B
)
[F36CFAF7378FD273151268CADA1ADD03CDF1DAF5] => Array
(
[name] => JAVA EE: Java : Collection Framework : Hierarchy(Iterable,Collection)
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.05SuZYfto9EdP9Y6Xg77PgHaEK?pid=Api
[datePublished] => 2018-05-27T00:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => http://2.bp.blogspot.com/-EHOexnP0lpY/VR6C4YAlBVI/AAAAAAAAGKE/6Vv5bvZ-qs0/s1600/Java%2B-%2BCollection%2BFramework%2B-%2BHierarchy.jpg
[hostPageUrl] => http://ramj2ee.blogspot.in/2015/04/java-collection-framework_73.html
[contentSize] => 85683 B
[width] => 1366
[height] => 768
[cDNContentUrl] => https://th.bing.com/th/id/R.d394ae6587eda3d11d3fd63a5e0efb3e?rik=P8avf3P4LTdRIQ&riu=http%3a%2f%2f2.bp.blogspot.com%2f-EHOexnP0lpY%2fVR6C4YAlBVI%2fAAAAAAAAGKE%2f6Vv5bvZ-qs0%2fs1600%2fJava%252B-%252BCollection%252BFramework%252B-%252BHierarchy.jpg&ehk=xwR7cQOGkmsTgi6zUOXxe%2fCWG%2bd6l0OXau2BmcGFk50%3d&risl=&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5FAD1FDC30DDA1ADAC862151372DF8737FAFC63F
[accentColor] => C65105
)
[687DBA8888803CF20F8C1B2A44DBCBECB23D9CEE] => Array
(
[name] => Green World STERCULIA FOETIDA / CHINA ALMOND / JAVA OLIVE TREE SEEDS ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.0vb_z8EpC6wPRVQKMO-scAHaGK?pid=Api
[datePublished] => 2021-08-14T05:32:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://rukminim1.flixcart.com/image/832/832/krwec280/plant-seed/q/g/j/10-sterculia-foetida-china-almond-java-olive-tree-seeds-for-original-imag5hacwefcxnpw.jpeg?q=70
[hostPageUrl] => https://www.flipkart.com/green-world-sterculia-foetida-china-almond-java-olive-tree-seeds-farming-gardening-1-kg-seed/p/itm5ff828d9eaae9
[contentSize] => 62205 B
[width] => 832
[height] => 693
[cDNContentUrl] => https://th.bing.com/th/id/R.d2f6ffcfc1290bac0f45540a30efac70?rik=hteriIgIwy%2fwyA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => EEC9D32BCEBCBD44A2B1C8F02FC3088888ABD786
[accentColor] => 7A2620
)
[F09DD24D3A4650FB96AB93DAB851392A65704BA9] => Array
(
[name] => Java Study Point (Java iQ): Java Program Coding Interview Questions
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.WTtgEAq0VJGBxXVt9xSrTgHaFl?pid=Api
[datePublished] => 2020-05-24T06:53:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://1.bp.blogspot.com/-ONWG5wIHPLU/XMVZuVWECkI/AAAAAAAAFlU/dc3UhvY5858j1i2WlBFoEPxrQ1h-y0GgACLcBGAs/s1600/Decimal-To-Binary-min.jpg
[hostPageUrl] => https://www.javaiq.in/2019/04/java-program-coding-interview-questions.html
[contentSize] => 41922 B
[width] => 600
[height] => 452
[cDNContentUrl] => https://th.bing.com/th/id/R.593b60100ab4549181c5756df714ab4e?rik=D9kt1KNkBb9pug&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 9AB40756A293158BAD39BA69BF0564A3D42DD90F
[accentColor] => 743D49
)
[D0D9381924D2EA48E6E40586BE56894CEB691644] => Array
(
[name] => Core JAVA - An Integrated Approach - Includes all versions upto JAVA 7 ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.5K5K0YJI95L1qhUbho0lUgHaJr?pid=Api
[datePublished] => 2023-09-27T02:00:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/71ovn3eRjWL._SL1500_.jpg
[hostPageUrl] => https://www.amazon.in/Core-JAVA-Integrated-Approach-versions/dp/B0CJC34BVK
[contentSize] => 172004 B
[width] => 1148
[height] => 1500
[cDNContentUrl] => https://th.bing.com/th/id/R.e4ae4ad18248f792f5aa151b868d2552?rik=DZ2DkUItroRuTg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 446196BEC49865EB68504E6E84AE2D4291839D0D
[accentColor] => AC761F
)
[BB957909F6686C2C4E52050D324ABC8004B42731] => Array
(
[name] => TAX assignment - tax - FACULTY OF LAW LAW OF TAXATION-II SESSION 2020 ...
[thumbnailUrl] => https://tse3.mm.bing.net/th/id/OIP.BKasSgjGqGEif_88BLB23gHaJl?pid=Api
[datePublished] => 2024-06-22T08:22:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://d20ohkaloyme4g.cloudfront.net/img/document_thumbnails/b02853e74013276bda228ab23a9ebac7/thumb_1200_1553.png
[hostPageUrl] => https://www.studocu.com/in/document/puducherry-technological-university/constitutional-law/tax-assignment-tax/92995239
[contentSize] => 472638 B
[width] => 1200
[height] => 1553
[cDNContentUrl] => https://th.bing.com/th/id/R.04a6ac4a08c6a861227fff3c04b076de?rik=u1mXkG%2bGxsLkJQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 13724B4008CBA423D05025E4C2C6866F909759BB
[accentColor] => 340E84
)
[E4D74C9058053A165A7B263B4F9142DD26AE9C32] => Array
(
[name] => The ML Hub
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.pd1JCY6XVkSN5LLCtP6EYwHaHg?pid=Api
[datePublished] => 2024-05-20T12:06:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://appxcontent.kaxa.in/paperimages/17067009681706700968_thump.png
[hostPageUrl] => https://web.ravindrababuravula.in/new-courses/28-dsa-in-python
[contentSize] => 130759 B
[width] => 496
[height] => 503
[cDNContentUrl] => https://th.bing.com/th/id/R.a5dd49098e9756448de4b2c2b4fe8463?rik=Tn3ECYVQo2Gltw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 23C9EA62DD2419F4B362B7A561A3508509C47D4E
[accentColor] => 54575A
)
[645FD5D75635F5832C0AF1A8C3376DD577D694AA] => Array
(
[name] => Binary Classification
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.6BBwMs8Tw6VKGYQyNQAT9AHaHE?pid=Api
[datePublished] => 2017-03-30T14:55:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.cse.iitk.ac.in/users/se367/10/presentation_local/Binary%20Classification_files/svm.png
[hostPageUrl] => https://www.cse.iitk.ac.in/users/se367/10/presentation_local/Binary%20Classification.html
[contentSize] => 34240 B
[width] => 628
[height] => 600
[cDNContentUrl] => https://th.bing.com/th/id/R.e8107032cf13c3a54a198432350013f4?rik=RvVdfWVTXzjCoA&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => AA496D775DD6733C8A1FA0C2385F53657D5DF546
[accentColor] => CB0000
)
[6D7C85452608C91103F2FF2777406354ADB2886B] => Array
(
[name] => Alpha Ready (Batch 1)
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.0XSCA0D-cxeQk3hRHoVybgHaFP?pid=Api
[datePublished] => 2022-07-21T14:43:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://lwfiles.mycourse.app/62a6cd5e1e9e2fbf212d608d-public/cd8389f148da1755ae14c5d06d0978b7.jpeg
[hostPageUrl] => https://www.apnacollege.in/course/placement-course-java
[contentSize] => 172972 B
[width] => 1920
[height] => 1357
[cDNContentUrl] => https://th.bing.com/th/id/R.d174820340fe7317909378511e85726e?rik=1sdYVGKAnBEwLw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => B6882BDA4536047772FF2F30119C80625458C7D6
[accentColor] => 05406D
)
[50ED90CF38014EB685C4FE5B9E8E195B964F6555] => Array
(
[name] => Introduction to Compiler Design: An Object-Oriented Approach Using Java ...
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.rt_H3EbCy8ZTfUBoLwMV7AAAAA?pid=Api
[datePublished] => 2025-01-26T01:16:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://m.media-amazon.com/images/I/41hq8lqsgHL._SX342_SY445_ML2_.jpg
[hostPageUrl] => https://www.amazon.in/Introduction-Compiler-Design-Object-Oriented-Approach/dp/1734139110
[contentSize] => 18419 B
[width] => 342
[height] => 421
[cDNContentUrl] => https://th.bing.com/th/id/R.aedfc7dc46c2cbc6537d40682f0315ec?rik=Bd4J%2fIMQ5GtYTA&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 5556F469B591E8E9B5EF4C586BE41083FC09DE05
[accentColor] => 023045
)
[C7F7CA949ECC3E22496B2F87CE457B6A6252DA74] => Array
(
[name] => String Handling in Java - Java Tutorial
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.NY7DuFh4hZcNEyIzUE3yUwHaDO?pid=Api
[datePublished] => 2015-06-13T11:04:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://www.sitesbay.com/java/images/string-handling-in-java.png
[hostPageUrl] => https://www.sitesbay.com/java/java-string-handling
[contentSize] => 23330 B
[width] => 543
[height] => 236
[cDNContentUrl] => https://th.bing.com/th/id/R.358ec3b8587885970d132233504df253?rik=fH%2bsSenM4yKUtg&pid=ImgRaw&r=0
[isTransparent] => 1
[imageId] => 47AD2526A6B754EC78F2B69422E3CCE949AC7F7C
[accentColor] => 0196CA
)
[E5B697986ADB8613B5AAD9EFB5CE8EA97C7C472D] => Array
(
[name] => GraffitiGRDN Ficus Benjamina Bonsai Weeping Fig Tree Benjamin Fig India ...
[thumbnailUrl] => https://tse4.mm.bing.net/th/id/OIP.hVozfF-vuhNoTrvmGULXawHaHa?pid=Api
[datePublished] => 2022-12-18T10:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://images-cdn.ubuy.co.in/661705fecc8c80511e6be0b4-ficus-benjamina-bonsai-weeping-fig-tree.jpg
[hostPageUrl] => https://www.ubuy.co.in/product/4SAMV5MZS-ficus-benjamina-20-seeds-for-planting
[contentSize] => 70226 B
[width] => 750
[height] => 750
[cDNContentUrl] => https://th.bing.com/th/id/R.855a337c5fafba13684ebbe61942d76b?rik=Xmt5iaa9aDFbqg&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => D274C7C79AE8EC5BFE9DAA5B3168BDA689796B5E
[accentColor] => 406A33
)
[1744DB35CC61C8E57A3CCB6A356236C829C37285] => Array
(
[name] => Class 9 History Chapter 4 Extra Question Answers - Forest Society and ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.cN6V4AS-_ue4qA6K2PgCeAAAAA?pid=Api
[datePublished] => 2019-03-02T05:59:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://edurev.gumlet.io/ApplicationImages/Temp/10129244_1212381d-81f2-43b1-86cd-55a4d4a530e1_lg.jpg
[hostPageUrl] => https://edurev.in/t/157851/Class-9-History-Chapter-4-Extra-Question-Answers-Forest-Society-and-Colonialism-Deducted-from-CBSE-2021-22-examination
[contentSize] => 39349 B
[width] => 405
[height] => 382
[cDNContentUrl] => https://th.bing.com/th/id/R.70de95e004befee7b8a80e8ad8f80278?rik=cUS9U8wWjF6nww&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 58273C928C632653A6BCC3A75E8C16CC53BD4471
[accentColor] => 494949
)
[66522368E810A93FD67983D783FB384CB6246B55] => Array
(
[name] => Difference between binary fission and multiple fission in tabular form ...
[thumbnailUrl] => https://tse1.mm.bing.net/th/id/OIP.2SOxdCpOBWRBtvAfS-1Q7QHaHa?pid=Api
[datePublished] => 2019-10-06T15:10:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://hi-static.z-dn.net/files/d20/bce267256ad3808271ea23f17566dd75.png
[hostPageUrl] => https://brainly.in/question/12844258
[contentSize] => 78563 B
[width] => 750
[height] => 750
[cDNContentUrl] => https://th.bing.com/th/id/R.d923b1742a4e056441b6f01f4bed50ed?rik=ZiUyho4BmvNtlw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 55B6426BC483BF387D38976DF39A018E86322566
[accentColor] => 4F667C
)
[CDF350C3FFAFA47EC0147283B9541D9749CBFAAA] => Array
(
[name] => House Robber III - DSA Problem | Talentd
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.Lj1QjAOhTYk_mUdAZhEFYQAAAA?pid=Api
[datePublished] => 2025-04-23T19:18:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://assets.leetcode.com/uploads/2021/03/10/rob2-tree.jpg
[hostPageUrl] => https://www.talentd.in/dsa-corner/questions/house-robber-iii
[contentSize] => 13065 B
[width] => 357
[height] => 293
[cDNContentUrl] => https://th.bing.com/th/id/R.2e3d508c03a14d893f99474066110561?rik=3D8FPP%2f6SucMQQ&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => AAAFBC9479D1459B3827410CE74AFAFF3C053FDC
[accentColor] => 884343
)
)
[relatedSearches] => Array
(
[0] => Array
(
[text] => BFS Tree Example
[displayText] => BFS Tree Example
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Tree+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5830.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Tree+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Tree+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[1] => Array
(
[text] => BFS Traversal
[displayText] => BFS Traversal
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Traversal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5832.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Traversal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[2] => Array
(
[text] => BFS Search Tree
[displayText] => BFS Search Tree
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Search+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5834.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Search+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+Search+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[3] => Array
(
[text] => BFS Code
[displayText] => BFS Code
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Code&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5836.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Code
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+Code&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[4] => Array
(
[text] => Depth of a Binary Tree
[displayText] => Depth of a Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Depth+of+a+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5838.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Depth+of+a+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Depth+of+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[5] => Array
(
[text] => BFS Implementation
[displayText] => BFS Implementation
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Implementation&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5840.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Implementation
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Implementation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[6] => Array
(
[text] => Binary Tree Height
[displayText] => Binary Tree Height
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Height&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5842.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Height
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Binary+Tree+Height&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[7] => Array
(
[text] => Binary Tree Nodes
[displayText] => Binary Tree Nodes
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Nodes&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5844.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Nodes
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Binary+Tree+Nodes&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[8] => Array
(
[text] => Binary Tree Levels
[displayText] => Binary Tree Levels
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Levels&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5846.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Levels
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Binary+Tree+Levels&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[9] => Array
(
[text] => BFS Algorithm C++
[displayText] => BFS Algorithm C++
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Algorithm+C%2b%2b&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5848.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Algorithm+C%2b%2b
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Algorithm+C%2b%2b&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[10] => Array
(
[text] => Complete Binary Tree
[displayText] => Complete Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Complete+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5850.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Complete+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Complete+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[11] => Array
(
[text] => Breadth First Tree
[displayText] => Breadth First Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Breadth+First+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5852.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Breadth+First+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Breadth+First+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[12] => Array
(
[text] => Time Complexity of BFS and DFS
[displayText] => Time Complexity of BFS and DFS
[webSearchUrl] => https://www.bing.com/images/search?q=Time+Complexity+of+BFS+and+DFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5854.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Time+Complexity+of+BFS+and+DFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Time+Complexity+of+BFS+and+DFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[13] => Array
(
[text] => BFS DFS Difference
[displayText] => BFS DFS Difference
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+DFS+Difference&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5856.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+DFS+Difference
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+DFS+Difference&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[14] => Array
(
[text] => Simple Binary Tree
[displayText] => Simple Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Simple+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5858.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Simple+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Simple+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[15] => Array
(
[text] => Space Complexity of BFS
[displayText] => Space Complexity of BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Space+Complexity+of+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5860.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Space+Complexity+of+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Space+Complexity+of+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[16] => Array
(
[text] => Inorder Tree Traversal
[displayText] => Inorder Tree Traversal
[webSearchUrl] => https://www.bing.com/images/search?q=Inorder+Tree+Traversal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5862.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Inorder+Tree+Traversal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Inorder+Tree+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[17] => Array
(
[text] => Width of a Binary Tree
[displayText] => Width of a Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Width+of+a+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5864.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Width+of+a+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Width+of+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[18] => Array
(
[text] => BFS PPT
[displayText] => BFS PPT
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+PPT&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5866.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+PPT
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+PPT&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[19] => Array
(
[text] => In Order Traversal Binary Tree
[displayText] => In Order Traversal Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=In+Order+Traversal+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5868.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=In+Order+Traversal+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=In+Order+Traversal+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[20] => Array
(
[text] => Binary Tree Postorder Traversal
[displayText] => Binary Tree Postorder Traversal
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Postorder+Traversal&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5870.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Postorder+Traversal
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Binary+Tree+Postorder+Traversal&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[21] => Array
(
[text] => Binary Tree Data Structure
[displayText] => Binary Tree Data Structure
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Data+Structure&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5872.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Data+Structure
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Binary+Tree+Data+Structure&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[22] => Array
(
[text] => Binary Tree BST
[displayText] => Binary Tree BST
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+BST&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5874.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+BST
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Binary+Tree+BST&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[23] => Array
(
[text] => Prod in Binary Tree
[displayText] => Prod in Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Prod+in+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5876.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Prod+in+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Prod+in+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[24] => Array
(
[text] => Tree Bfsp
[displayText] => Tree Bfsp
[webSearchUrl] => https://www.bing.com/images/search?q=Tree+Bfsp&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5878.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Tree+Bfsp
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Tree+Bfsp&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[25] => Array
(
[text] => Maximum Binary Tree
[displayText] => Maximum Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Maximum+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5880.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Maximum+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Maximum+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[26] => Array
(
[text] => Breadth First Search Graph
[displayText] => Breadth First Search Graph
[webSearchUrl] => https://www.bing.com/images/search?q=Breadth+First+Search+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5882.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Breadth+First+Search+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[27] => Array
(
[text] => Binary Tree 15
[displayText] => Binary Tree 15
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+15&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5884.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+15
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Binary+Tree+15&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[28] => Array
(
[text] => 3D Picture of Binary Tree
[displayText] => 3D Picture of Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=3D+Picture+of+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5886.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=3D+Picture+of+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=3D+Picture+of+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[29] => Array
(
[text] => Binary Tree Level. Order
[displayText] => Binary Tree Level. Order
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+Level.+Order&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5888.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+Level.+Order
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Binary+Tree+Level.+Order&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[30] => Array
(
[text] => What's DFS Tree
[displayText] => What's DFS Tree
[webSearchUrl] => https://www.bing.com/images/search?q=What%27s+DFS+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5890.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=What%27s+DFS+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=What%27s+DFS+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[31] => Array
(
[text] => Binary Tree with Pointers
[displayText] => Binary Tree with Pointers
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+with+Pointers&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5892.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+with+Pointers
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Binary+Tree+with+Pointers&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[32] => Array
(
[text] => Binary Plus Tree
[displayText] => Binary Plus Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Plus+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5894.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Plus+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Binary+Plus+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[33] => Array
(
[text] => Differentiate Between DFS and BFS
[displayText] => Differentiate Between DFS and BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Differentiate+Between+DFS+and+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5896.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Differentiate+Between+DFS+and+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=Differentiate+Between+DFS+and+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[34] => Array
(
[text] => Recursive BFS
[displayText] => Recursive BFS
[webSearchUrl] => https://www.bing.com/images/search?q=Recursive+BFS&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5898.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Recursive+BFS
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Recursive+BFS&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[35] => Array
(
[text] => BFS Problems
[displayText] => BFS Problems
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Problems&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5900.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Problems
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=BFS+Problems&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[36] => Array
(
[text] => Where Is the Leaf within a Binary Tree
[displayText] => Where Is the Leaf within a Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Where+Is+the+Leaf+within+a+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5902.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Where+Is+the+Leaf+within+a+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Where+Is+the+Leaf+within+a+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[37] => Array
(
[text] => BFS Tree Traversal Queue
[displayText] => BFS Tree Traversal Queue
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Tree+Traversal+Queue&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5904.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Tree+Traversal+Queue
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+Tree+Traversal+Queue&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[38] => Array
(
[text] => Binary Tree vs Binary Search Tree
[displayText] => Binary Tree vs Binary Search Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+vs+Binary+Search+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5906.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+vs+Binary+Search+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=Binary+Tree+vs+Binary+Search+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[39] => Array
(
[text] => BFS Small Tree Example
[displayText] => BFS Small Tree Example
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Small+Tree+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5908.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Small+Tree+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=BFS+Small+Tree+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[40] => Array
(
[text] => Binary Tre Graph
[displayText] => Binary Tre Graph
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tre+Graph&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5910.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tre+Graph
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Binary+Tre+Graph&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[41] => Array
(
[text] => BFS Tree Digram
[displayText] => BFS Tree Digram
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Tree+Digram&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5912.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Tree+Digram
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+Tree+Digram&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[42] => Array
(
[text] => BFS Tree in HTML
[displayText] => BFS Tree in HTML
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Tree+in+HTML&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5914.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Tree+in+HTML
[thumbnail] => Array
(
[thumbnailUrl] => https://tse2.mm.bing.net/th?q=BFS+Tree+in+HTML&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[43] => Array
(
[text] => DFS Pre-Order
[displayText] => DFS Pre-Order
[webSearchUrl] => https://www.bing.com/images/search?q=DFS+Pre-Order&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5916.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=DFS+Pre-Order
[thumbnail] => Array
(
[thumbnailUrl] => https://tse4.mm.bing.net/th?q=DFS+Pre-Order&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[44] => Array
(
[text] => BFS and DFS Examples
[displayText] => BFS and DFS Examples
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+and+DFS+Examples&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5918.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+and+DFS+Examples
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+and+DFS+Examples&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[45] => Array
(
[text] => BFS Problem Tree
[displayText] => BFS Problem Tree
[webSearchUrl] => https://www.bing.com/images/search?q=BFS+Problem+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5920.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=BFS+Problem+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=BFS+Problem+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[46] => Array
(
[text] => Binary Tree DFS Animation
[displayText] => Binary Tree DFS Animation
[webSearchUrl] => https://www.bing.com/images/search?q=Binary+Tree+DFS+Animation&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5922.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Binary+Tree+DFS+Animation
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Binary+Tree+DFS+Animation&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[47] => Array
(
[text] => Breadth First Search Python Example
[displayText] => Breadth First Search Python Example
[webSearchUrl] => https://www.bing.com/images/search?q=Breadth+First+Search+Python+Example&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5924.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Breadth+First+Search+Python+Example
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=Breadth+First+Search+Python+Example&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[48] => Array
(
[text] => 3 Level Binary Tree
[displayText] => 3 Level Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=3+Level+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5926.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=3+Level+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse3.mm.bing.net/th?q=3+Level+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
[49] => Array
(
[text] => Linked Binary Tree
[displayText] => Linked Binary Tree
[webSearchUrl] => https://www.bing.com/images/search?q=Linked+Binary+Tree&FORM=IRPATC
[webSearchUrlPingSuffix] => images.LB.1,5928.1
[searchLink] => https://www.bing.com/api/v7/images/search?q=Linked+Binary+Tree
[thumbnail] => Array
(
[thumbnailUrl] => https://tse1.mm.bing.net/th?q=Linked+Binary+Tree&pid=Api&mkt=en-US&cc=US&setlang=en&adlt=strict&t=1
)
)
)
[createdate] => 1777837848768
)
[json_error] => No error
[products_count] => 120
[related_searches_count] => 50
[first_product_sample] => Array
(
[name] => Virtual Labs
[thumbnailUrl] => https://tse2.mm.bing.net/th/id/OIP.ugX0d96v4ah3ETo0tAXTZgHaGn?pid=Api
[datePublished] => 2021-03-23T09:12:00.0000000Z
[isFamilyFriendly] => 1
[contentUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/images/bfs.jpeg
[hostPageUrl] => https://ds1-iiith.vlabs.ac.in/exp/tree-traversal/breadth-first-traversal/breadth-first-traversal-theory.html
[contentSize] => 40472 B
[width] => 651
[height] => 581
[cDNContentUrl] => https://th.bing.com/th/id/R.ba05f477deafe1a877113a34b405d366?rik=L2MHpjZpWdfiWw&pid=ImgRaw&r=0
[isTransparent] =>
[imageId] => 27B42260B72F91A1FE5A5BE2D7596936A607632F
[accentColor] => 2777A4
)
)
[skipped_products] => Array
(
)
)
How to Discover Better Bfs Binary Tree Java Options
Try combining terms like fit, fabric, or occasion with your core query. For example, add words like oversized, linen, party, office, or wedding to get more targeted fashion product discovery results.
Search Help
Are these results from one store only?
No, Styleberry is a discovery layer that surfaces fashion products from multiple sources to simplify comparison.
Can I search using occasion terms like office or wedding?
Yes, occasion keywords often produce stronger and more relevant results for fashion discovery.