Tree traversal algorithms (BFS and DFS - Preorder, Inorder, Postorder)

array(10) { [0]=> object(stdClass)#5763 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "KccYKSF4A4g" ["related_video_title"]=> string(63) "Programmer Q&A - Answering your most interesting questions!" ["posted_time"]=> string(19) "1 год назад" ["channelName"]=> string(10) "CodeBeauty" } [1]=> object(stdClass)#5736 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "UHxtjVsOTHc" ["related_video_title"]=> string(76) "Tree data structure - types of trees, examples, code and uses in programming" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(10) "CodeBeauty" } [2]=> object(stdClass)#5761 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "4iDv8Zu8L3I" ["related_video_title"]=> string(32) "Поиск в ширину (BFS)" ["posted_time"]=> string(21) "2 года назад" ["channelName"]=> string(69) "Олимпиадное программирование в УлГТУ" } [3]=> object(stdClass)#5768 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "BHB0B1jFKQc" ["related_video_title"]=> string(104) "Binary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal." ["posted_time"]=> string(19) "6 лет назад" ["channelName"]=> string(16) "Back To Back SWE" } [4]=> object(stdClass)#5747 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "aEgG4pidcKU" ["related_video_title"]=> string(74) "Map in C++ with practical examples - step by step Data Structures tutorial" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(10) "CodeBeauty" } [5]=> object(stdClass)#5765 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "cPdGt9v0Bag" ["related_video_title"]=> string(73) "Угроза для всего мира / Резкое заявление" ["posted_time"]=> string(24) "10 часов назад" ["channelName"]=> string(10) "NEXTA Live" } [6]=> object(stdClass)#5760 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "fAAZixBzIAI" ["related_video_title"]=> string(61) "Binary Tree Algorithms for Technical Interviews - Full Course" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(16) "freeCodeCamp.org" } [7]=> object(stdClass)#5770 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "95Mkwbsk2HQ" ["related_video_title"]=> string(79) "Можно ли поменять родину так быстро? / вДудь" ["posted_time"]=> string(21) "1 день назад" ["channelName"]=> string(10) "вДудь" } [8]=> object(stdClass)#5746 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "-StYr9wILqo" ["related_video_title"]=> string(83) "Doubly Linked Lists detailed explanation for beginners (C++ Data Structures course)" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(10) "CodeBeauty" } [9]=> object(stdClass)#5764 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "pcKY4hjDrxk" ["related_video_title"]=> string(81) "5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search" ["posted_time"]=> string(19) "7 лет назад" ["channelName"]=> string(10) "Abdul Bari" } }