## Binary Tree

Binary Tree
# 1
03-31-2011
Binary Tree

I have just been researching this topic and I was wondering what type of application might a binary tree be used for. For instance what type of application would be a good showcase for a binary tree that I could write as an example?
 sepoto View Public Profile for sepoto Find all posts by sepoto
# 2
03-31-2011
Binary means two choices; as in left-right, up-down, yes-no, ...

One real-life application is the game '20 questions'. Twenty questions are asked and by the end, there should be a guess (perhaps correct) of the answer.

For instance, guess the state in US:
1) Is the name one word -- NO
2) Does the state border an ocean -- YES
3) Is it an original 13 state -- YES

Without continuing, the answer is -- Rhode Island.

Thus, questions need to be decided, and a matching file created that maps out the YES/NO answers.

Does that make sense?
 joeyg View Public Profile for joeyg Find all posts by joeyg
# 3
03-31-2011
I think so yes. Thanks for your reply. Does C++ have any built in classes to handle binary trees or do I have to do all the plumbing myself?
 sepoto View Public Profile for sepoto Find all posts by sepoto
# 4
03-31-2011
Also another application is the use of heaps - usually binary trees with a specific order: All elements to left are smaller than the node, the elements on the right are bigger.

This is good if you need any form of ordered data, because search is done faster than in a simple list ( O(log n) instead of O(n) )
 disaster View Public Profile for disaster Find all posts by disaster
# 5
04-07-2011
Binary tree

In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child.

Binary trees are used to implement binary search trees and binary heaps.
 alma111 View Public Profile for alma111 Find all posts by alma111
# 6
04-07-2011
lcm.csa.iisc.ernet.in/dsa/node88.html
you can find application here

---------- Post updated at 08:24 AM ---------- Previous update was at 08:21 AM ----------

following are some more applications

• binary earch tree - Used in many search applications where data is constantly entering/leaving, such as the map and set objects in many languages' libraries.
• binary search partiton- Used in almost every 3D video game to determine what objects need to be rendered.
• Used in almost every high-bandwidth router for storing router-tables.
 shamapraveen View Public Profile for shamapraveen Find all posts by shamapraveen

## Problem in printing binary tree using php and mysql

Database Structure Root Table ID Root_ Node Level 1 A 0 2 B 1 3 C 1 Child Table ID Left_Node Right_Node Root_Node Root_ID 1 B C A 1 ...

## 2. Programming

I have some questions about certain placement of child nodes since I'm just learning BSTs and it's quite confusing even after reading some sources and doing some online insertion applets. Let's say I want to add nodes 5,7,3,4 to an empty basic BST. ...

## Convert binary file to csv and then back to the binary format

Hello *nix specialists, Im working for a non profit organisation in Germany to transport DSL over WLAN to people in areas without no DSL. We are using Linksys WRT 54 router with DD-WRT firmware There are at the moment over 180 router running but we have to change some settings next time. So my...

## Binary Search Tree Search problem

I am writing code for a binary search tree search and when I compile it i am getting strange errors such as, " /tmp/ccJ4X8Xu.o: In function `btree::btree()': project1.cpp:(.text+0x0): multiple definition of `btree::btree()' " What does that mean exactly? tree.h #ifndef TREE_H #define...

## process tree

how to draw a process tree if i know my process id and how can i identify session leaders

## directory tree

Hi all, The following is a script for displaying directory tree. D=\${1:-`pwd`} (cd \$D; pwd) find \$D -type d -print | sort | sed -e "s,^\$D,,"\ -e "/^\$/d"\ -e "s,*/\(*\)\$,\:-----\1,"\ -e "s,*/,: ,g" | more exit 0 I am trying to understand the above script.But...

## Binary Tree Creation Using fork()

Hi, I am working on a program and kind of a stuck,nt getting it done. "The program should take one command line arguments: number of hierarchy level. The hierarchy of your program should of that level and each node have two child processes." Can anyone give me the C code using fork() of this...

## Create a binary tree

I need to create a binary tree like structure of directories using shell script... does anyone know of any algorithm for this ? i tried doing a recursive algorithm function CreateDir { level=\$1 dirname=\$2 mkdir \$dirname/sub1/ mkdir \$dirname/sub2/ let level=level-1 ...

## compiled binary file gives "cannot execute binary file"

Hi, I have two Solaris machines. 1. SunOS X 5.8 Generic_108528-29 sun4u sparc SUNW,Sun-Blade-1500 2. SunOS Y 5.8 Generic_108528-13 sun4u sparc SUNW,Ultra-60 I am trying to buiild a project on both these machines. The Binary output file compiled on machine 2 runs on both the machines. Where...

## Creating breadth traversal binary tree

I almost have the entire script written. however the problem is how would i assign the global variable to terminate the process from the bottom up to ensure the child terminates so the parent can. ex. I am proccess 1 I am proccess 2 etc Here is the code \$ cat tree.c ...