{"id":26903,"date":"2017-12-26T21:12:21","date_gmt":"2017-12-26T15:42:21","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26903"},"modified":"2017-12-26T21:12:21","modified_gmt":"2017-12-26T15:42:21","slug":"java-programming-binary-tree-introduction","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-binary-tree-introduction\/","title":{"rendered":"Java Programming – Binary Tree | Set 1 (Introduction)"},"content":{"rendered":"

Trees:<\/strong> Unlike Arrays, Linked Lists, Stack and queues, which are linear data structures, trees are hierarchical data structures.<\/span><\/p>\n

Tree Vocabulary: <\/strong>The topmost node is called root of the tree. The elements that are directly under an element are called its children. The element directly above something is called its parent. For example, a is a child of f and f is the parent of a. Finally, elements with no children are called leaves.<\/p>\n

      tree\r\n      ----\r\n       j    <-- root\r\n     \/   \\\r\n    f      k  \r\n  \/   \\      \\\r\n a     h      z    <-- leaves<\/pre>\n
Why Trees?<\/strong>
\n1.<\/strong> One reason to use trees might be because you want to store information that naturally forms a hierarchy. For example, the file system on a computer:<\/p>\n
file system\r\n-----------\r\n     \/    <-- root\r\n  \/      \\\r\n...       home\r\n      \/          \\\r\n   ugrad        course\r\n    \/       \/      |     \\\r\n  ...      cs101  cs112  cs113<\/pre>\n
2.<\/strong> Trees (with some ordering e.g., BST) provide moderate access\/search (quicker than Linked List and slower than arrays).
\n3.<\/strong> Trees provide moderate insertion\/deletion (quicker than Arrays and slower than Unordered Linked Lists).
\n4.<\/strong> Like Linked Lists and unlike Arrays, Trees don\u2019t have an upper limit on number of nodes as nodes are linked using pointers.<\/p>\n[ad type=”banner”]\n
Main applications of trees include:<\/strong>
\n1.<\/strong> Manipulate hierarchical data.
\n2.<\/strong> Make information easy to search (see tree traversal).
\n3.<\/strong> Manipulate sorted lists of data.
\n4.<\/strong> As a workflow for compositing digital images for visual effects.
\n5. <\/strong>Router algorithms
\n6. <\/strong>Form of a multi-stage decision-making (see business chess).<\/p>\n
Binary Tree:<\/strong> A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.<\/p>\n
Binary Tree Representation in C: <\/strong>A tree is represented by a pointer to the topmost node in tree. If the tree is empty, then value of root is NULL.
\nA Tree node contains following parts.
\n1. Data
\n2. Pointer to left child
\n3. Pointer to right child<\/p>\n
In C, we can represent a tree node using structures. Below is an example of a tree node with an integer data.<\/p>\n\n\n\n
\n
\n
\/* Class containing left and right child of current<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>node and key value*\/<\/code><\/div>\n
class<\/code> Node<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>int<\/code> key;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>Node left, right;<\/code><\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>public<\/code> Node(<\/code>int<\/code> item)<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>{<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>key = item;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>left = right = <\/code>null<\/code>;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n[ad type=”banner”]\n
First Simple Tree in C<\/strong>
\nLet us create a simple tree with 4 nodes in C. The created tree would be as following.<\/p>\n
      tree\r\n      ----\r\n       1    <-- root\r\n     \/   \\\r\n    2     3  \r\n   \/   \r\n  4\r\nJava Program:\r\n<\/strong><\/pre>\n
 
 <\/div> 
\/* Class containing left and right child of current   node and key value*\/class Node{    int key;    Node left, right;     public Node(int item)    {        key = item;        left = right = null;    }} \/\/ A Java program to introduce Binary Treeclass BinaryTree{    \/\/ Root of Binary Tree    Node root;     \/\/ Constructors    BinaryTree(int key)    {        root = new Node(key);    }     BinaryTree()    {        root = null;    }     public static void main(String[] args)    {        BinaryTree tree = new BinaryTree();         \/*create root*\/        tree.root = new Node(1);         \/* following is the tree after above statement               1            \/   \\          null  null     *\/         tree.root.left = new Node(2);        tree.root.right = new Node(3);         \/* 2 and 3 become left and right children of 1               1             \/   \\            2      3          \/    \\    \/  \\        null null null null  *\/          tree.root.left.left = new Node(4);        \/* 4 becomes left child of 2                    1                \/       \\               2          3             \/   \\       \/  \\            4    null  null  null           \/   \\          null null         *\/    }}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Java Programming – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[80139,1,2139],"tags":[72683,80274,80278,80276,80275,80280,80277,83754,83752,83751,83757,83755,83758,83753,83756,80279],"class_list":["post-26903","post","type-post","status-publish","format-standard","hentry","category-binary-tree-divide-and-conquer","category-coding","category-java","tag-binary-tree-c","tag-binary-tree-implementation-in-java","tag-binary-tree-java-api","tag-binary-tree-java-code","tag-binary-tree-java-example","tag-create-binary-search-tree-java","tag-how-to-implement-a-simple-binary-search-tree-in-java","tag-java-programming-books","tag-java-programming-examples-pdf","tag-java-programming-for-beginners","tag-java-programming-pdf","tag-java-programming-software","tag-java-programming-tutorial","tag-java-programming-w3schools","tag-java-programming-youtube","tag-write-a-program-to-create-a-binary-tree-in-java"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26903","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26903"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26903\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26903"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26903"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26903"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}