A binary tree is a tree data structures in which each node have at most two child nodes, generally distinguished as "right" and "left". Nodes with children are called parent nodes, and child nodes may retain references to their parents. Outside the tree, there is often an instance to the "root" node, if it exists. Any node in the data structure may be reached by starting at root node and repeatedly following instances to either the right or left child. A tree which does not contain any node other than root node is named a null tree. In a binary tree a degree of every node is maximum two. A tree with 'n' number of nodes has accurate 'n-1' degree or branches.

 

Posted Date: 7/27/2012 6:29:54 AM | Location : United States

Ask an Expert

Related Discussions:- Binary tree, Assignment Help, Ask Question on Binary tree, Get Answer, Expert's Help, Binary tree Discussions

Write discussion on Binary tree
Your posts are moderated

Write your message here..

Related Questions

Row major storage, Q. Take an array A[20, 10] of your own. Suppose 4 words ... Q. Take an array A[20, 10] of your own. Suppose 4 words per memory cell and the base address of array A is 100. Find the address of A[11, 5] supposed row major storage.

Preorder traversal of a binary tree, Preorder traversal of a binary tree ... Preorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; };   preorder(struct N

Array, how to define the size of array how to define the size of array

Splaying steps - splay trees, Readjusting for tree modification calls for r... Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

Sort list of distinct numbers in ascending order - quicksort, (1) Sort a li... (1) Sort a list of distinct numbers in ascending order, using the following divide- and-conquer strategy (Quicksort): divide the list of numbers into two lists: one that contains a

Algorithm to insert element to a max-heap sequentially, Q. Write  down the ... Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

Sorting, how to do a merge sorting how to do a merge sorting

Efficiency of linear search, Efficiency of Linear Search How much numbe... Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

Draw a flowchart that takes temperatures input, Write an algorithm in form ... Write an algorithm in form of a flowchart that takes temperatures input over a 100 day period (once per day) and outputs the number of days when temperature was below 20C and numbe

Create a function to show data structure, Given a number that is represente... Given a number that is represented in your data structure, you will need a function that prints it out in base 215 in such a way that its contents can be checked for correctness. Y