binary tree - Wikitechy https://www.wikitechy.com/interview-questions/tag/binary-tree/ Interview Questions Mon, 13 Sep 2021 07:07:39 +0000 en-US hourly 1 https://wordpress.org/?v=6.9.4 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png binary tree - Wikitechy https://www.wikitechy.com/interview-questions/tag/binary-tree/ 32 32 What is Binary Search Tree ? https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-search-tree/ https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-search-tree/#respond Tue, 13 Jul 2021 17:58:10 +0000 https://www.wikitechy.com/interview-questions/?p=515

What is binary search tree ?

  • The Binary search tree is a node-based on the binary tree data structure has the following properties,
    • The left-side sub tree of a node contains only nodes with keys lesser than the node’s key.
    • The right-side sub tree of a node contains only nodes with keys greater than the node’s key.
    • The left-side and right-side subtree each must also be a binary search tree.
Binary Search Tree

Binary Search Tree Traversing

Pre-order traversal

  • This traversal technique it may be traversal order is root-left-right.
    • Visit the node.
    • Call itself to traverse the node’s left subtree.
    • Call itself to traverse the node’s right subtree.

Algoithm

preOrder (t)
     {
       if (t is not empty)
        {
              access the root element of t;
              preOrder (leftTree (t));
              preOrder (rightTree (t));
       } // if
    } // preOrder traversal

Post-order traversal

  • This traversal technique the traversal order is left-right-root.
    • Call itself to traverse the node’s left subtree.
    • Call itself to traverse the node’s right subtree.
    • Visit the node.

Algoithm

postOrder (t)
 { 
   if (t is not empty) 
    { 
       postOrder(leftTree(t));
       postOrder(rightTree(t)); 
       access the root element of t;
    } // if 
} // postOrder traversal

n-order traversal

  • An in-order traversal of a binary search tree will cause all the nodes to be visited in ascending order, based on their key values. If you want to create a sorted list of the data in a binary tree, this is one way to do it.
    • Call itself to traverse the node’s left subtree.
    • Visit the node.
    • Call itself to traverse the node’s right subtree

Algoithm

private void inOrder(node localRoot) 
{ 
  if(localRoot != null) 
   {
      inOrder(localRoot.leftChild);
      localRoot.displayNode(); 
      inOrder(localRoot.rightChild); 
   }
 }

Binary Tree Traversing

Advantages

  • Binary Search Tree is fast in insertion and deletion etc when balanced.
  • It is very efficient and its code is easier than Linklists.

Disadvantages

  • The main disadvantage is that we should always implement a balanced binary search tree – AVL tree, Red-Black tree, Splay tree. Otherwise the cost of operations may not be logarithmic and degenerate into a linear search on an array.
  • Shape of the tree depends upon order of insertion and it can be degenerated.
  • Searching takes long time.
]]> https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-search-tree/feed/ 0 What is Binary Tree in Data Structures ? https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-tree-in-data-structures/ https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-tree-in-data-structures/#respond Tue, 13 Jul 2021 16:37:21 +0000 https://www.wikitechy.com/interview-questions/?p=495

What is Binary Tree in Data Structures ?

  • Binary tree is a special type of data structure. In binary tree, every node can have a maximum of 2 children, which are known as Left child and Right Child.
  • It is a method of placing and locating the records in a database, especially when all the data is known to be in random access memory (RAM).
  • A binary tree has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in linked list.
What is Binary Tree in Data Structures

Representation of Binary Tree using Array

  • Binary tree using array represents a node which is numbered sequentially level by level from left to right. Even empty nodes are numbered.

Sample Code

// JAVA implementation of tree using array 
// numbering starting from 0 to n-1. 
import java.util.*;
import java.lang.*;
import java.io.*;

class bTree {
    public static void main(String[] args) {
        btree_Array obj = new btree_Array();
        obj.Root("P");
        // obj.set_Left("Q", 0); 
        obj.set_Right("R", 0);
        obj.set_Left("S", 1);
        obj.set_Right("T", 1);
        obj.set_Left("U", 2);
        obj.print_Tree();
    }
}

class btree_Array {
    static int root = 0;
    static String[] s = new String[10];

    /*create root*/
    public void Root(String key) {
        s[0] = key;
    }

    /*create left son of root*/
    public void set_Left(String key, int root) {
        int t = (root * 2) + 1;

        if (s[root] == null) {
            System.out.printf("Can't set child at %d, no parent found\n", t);
        } else {
            s[t] = key;
        }
    }

    /*create right son of root*/
    public void set_Right(String key, int root) {
        int t = (root * 2) + 2;

        if (s[root] == null) {
            System.out.printf("Can't set child at %d, no parent found\n", t);
        } else {
            s[t] = key;
        }
    }

    public void print_Tree() {
        for (int i = 0; i < 10; i++) {
            if (s[i] != null)
                System.out.print(s[i]);
            else
                System.out.print("-");

        }
    }
}

Output

Can't set child at 3, no parent found
Can't set child at 4, no parent found
P-R--U----
]]> https://www.wikitechy.com/interview-questions/data-structure/what-is-binary-tree-in-data-structures/feed/ 0