{"id":838,"date":"2023-10-20T04:01:35","date_gmt":"2023-10-20T04:01:35","guid":{"rendered":"https:\/\/learnlearn.uk\/ibcs\/?page_id=838"},"modified":"2023-10-20T08:50:26","modified_gmt":"2023-10-20T08:50:26","slug":"non-binary-tree","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/","title":{"rendered":"Non Binary Tree"},"content":{"rendered":"<div class=\"responsive-tabs\">\n<h2 class=\"tabtitle\">Introduction<\/h2>\n<div class=\"tabcontent\">\n\n<h3>Introduction to non-binary trees<\/h3>\n<div id=\"attachment_849\" style=\"width: 310px\" class=\"wp-caption alignright\"><a href=\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree.jpg\"><img aria-describedby=\"caption-attachment-849\" decoding=\"async\" loading=\"lazy\" class=\"size-medium wp-image-849\" src=\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-300x164.jpg\" alt=\"\" width=\"300\" height=\"164\" srcset=\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-300x164.jpg 300w, https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-1024x561.jpg 1024w, https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-768x421.jpg 768w, https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree.jpg 1253w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/a><p id=\"caption-attachment-849\" class=\"wp-caption-text\">A non binary tree representing a company hierarchy<\/p><\/div>\n<p>A non-binary tree (aka multiway tree) is a tree data structure in which each node can have more than two children. This is in contrast to a binary tree, where each node has at most two children (often referred to as the left child and the right child). Non-binary trees are used in various applications and have different variations, each with its own advantages and use cases.<\/p>\n<ul>\n<li>File Structure Traversal<\/li>\n<li>HTML \/ XML Traversal<\/li>\n<li>Organisation Structures<\/li>\n<li>Family Tree<\/li>\n<li>Routing Tables<\/li>\n<\/ul>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Introduction to non-binary trees A non-binary tree (aka multiway tree) is a tree data structure in which each node can have more than two children. This is in contrast to a binary tree, where each node has at most two children (often referred to as the left child and the right child). Non-binary trees are&hellip;&nbsp;<a href=\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\" class=\"\" rel=\"bookmark\">Read More &raquo;<span class=\"screen-reader-text\">Non Binary Tree<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"off","neve_meta_content_width":100,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"","neve_meta_disable_title":""},"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v20.6 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Non Binary Tree - IB Computer Science<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Non Binary Tree - IB Computer Science\" \/>\n<meta property=\"og:description\" content=\"Introduction to non-binary trees A non-binary tree (aka multiway tree) is a tree data structure in which each node can have more than two children. This is in contrast to a binary tree, where each node has at most two children (often referred to as the left child and the right child). Non-binary trees are&hellip;&nbsp;Read More &raquo;Non Binary Tree\" \/>\n<meta property=\"og:url\" content=\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\" \/>\n<meta property=\"og:site_name\" content=\"IB Computer Science\" \/>\n<meta property=\"article:modified_time\" content=\"2023-10-20T08:50:26+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-300x164.jpg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Estimated reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\",\"url\":\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\",\"name\":\"Non Binary Tree - IB Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#website\"},\"datePublished\":\"2023-10-20T04:01:35+00:00\",\"dateModified\":\"2023-10-20T08:50:26+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/#breadcrumb\"},\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"IB Computer Science\",\"item\":\"https:\/\/learnlearn.uk\/ibcs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Non Binary Tree\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#website\",\"url\":\"https:\/\/learnlearn.uk\/ibcs\/\",\"name\":\"IB Computer Science\",\"description\":\"- learnlearn..uk\",\"publisher\":{\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/learnlearn.uk\/ibcs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#organization\",\"name\":\"IB Computer Science\",\"url\":\"https:\/\/learnlearn.uk\/ibcs\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2022\/09\/LearnLearnLogowhite-300x41.png\",\"contentUrl\":\"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2022\/09\/LearnLearnLogowhite-300x41.png\",\"width\":300,\"height\":41,\"caption\":\"IB Computer Science\"},\"image\":{\"@id\":\"https:\/\/learnlearn.uk\/ibcs\/#\/schema\/logo\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Non Binary Tree - IB Computer Science","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/","og_locale":"en_GB","og_type":"article","og_title":"Non Binary Tree - IB Computer Science","og_description":"Introduction to non-binary trees A non-binary tree (aka multiway tree) is a tree data structure in which each node can have more than two children. This is in contrast to a binary tree, where each node has at most two children (often referred to as the left child and the right child). Non-binary trees are&hellip;&nbsp;Read More &raquo;Non Binary Tree","og_url":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/","og_site_name":"IB Computer Science","article_modified_time":"2023-10-20T08:50:26+00:00","og_image":[{"url":"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2023\/10\/Non-binary-tree-300x164.jpg"}],"twitter_card":"summary_large_image","twitter_misc":{"Estimated reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/","url":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/","name":"Non Binary Tree - IB Computer Science","isPartOf":{"@id":"https:\/\/learnlearn.uk\/ibcs\/#website"},"datePublished":"2023-10-20T04:01:35+00:00","dateModified":"2023-10-20T08:50:26+00:00","breadcrumb":{"@id":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/#breadcrumb"},"inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/learnlearn.uk\/ibcs\/non-binary-tree\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"IB Computer Science","item":"https:\/\/learnlearn.uk\/ibcs\/"},{"@type":"ListItem","position":2,"name":"Non Binary Tree"}]},{"@type":"WebSite","@id":"https:\/\/learnlearn.uk\/ibcs\/#website","url":"https:\/\/learnlearn.uk\/ibcs\/","name":"IB Computer Science","description":"- learnlearn..uk","publisher":{"@id":"https:\/\/learnlearn.uk\/ibcs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/learnlearn.uk\/ibcs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-GB"},{"@type":"Organization","@id":"https:\/\/learnlearn.uk\/ibcs\/#organization","name":"IB Computer Science","url":"https:\/\/learnlearn.uk\/ibcs\/","logo":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/learnlearn.uk\/ibcs\/#\/schema\/logo\/image\/","url":"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2022\/09\/LearnLearnLogowhite-300x41.png","contentUrl":"https:\/\/learnlearn.uk\/ibcs\/wp-content\/uploads\/sites\/25\/2022\/09\/LearnLearnLogowhite-300x41.png","width":300,"height":41,"caption":"IB Computer Science"},"image":{"@id":"https:\/\/learnlearn.uk\/ibcs\/#\/schema\/logo\/image\/"}}]}},"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"learnlearnadmin","author_link":"https:\/\/learnlearn.uk\/ibcs\/author\/learnlearnadmin\/"},"rttpg_comment":0,"rttpg_category":null,"rttpg_excerpt":"Introduction to non-binary trees A non-binary tree (aka multiway tree) is a tree data structure in which each node can have more than two children. This is in contrast to a binary tree, where each node has at most two children (often referred to as the left child and the right child). Non-binary trees are&hellip;&nbsp;Read&hellip;","_links":{"self":[{"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/pages\/838"}],"collection":[{"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/comments?post=838"}],"version-history":[{"count":5,"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/pages\/838\/revisions"}],"predecessor-version":[{"id":850,"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/pages\/838\/revisions\/850"}],"wp:attachment":[{"href":"https:\/\/learnlearn.uk\/ibcs\/wp-json\/wp\/v2\/media?parent=838"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}