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?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
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
... (3 Replies)
Discussion started by: slurpeyatari
3 Replies
2. Solaris
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... (0 Replies)
Discussion started by: scgupta
0 Replies
3. Shell Programming and Scripting
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
... (2 Replies)
Discussion started by: macvijay1985
2 Replies
4. UNIX for Dummies Questions & Answers
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... (1 Reply)
Discussion started by: learneros
1 Replies
5. Shell Programming and Scripting
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... (3 Replies)
Discussion started by: ravi raj kumar
3 Replies
6. Shell Programming and Scripting
how to draw a process tree if i know my process id
and how can i identify session leaders (1 Reply)
Discussion started by: annapurna konga
1 Replies
7. Programming
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... (1 Reply)
Discussion started by: meredith1990
1 Replies
8. Shell Programming and Scripting
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... (7 Replies)
Discussion started by: digidax
7 Replies
9. 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.
... (1 Reply)
Discussion started by: Jill Ceke
1 Replies
10. Web Development
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
... (1 Reply)
Discussion started by: Deepak Tiwari
1 Replies
LEARN ABOUT FREEBSD
twalk
TSEARCH(3) BSD Library Functions Manual TSEARCH(3)
NAME
tsearch, tfind, tdelete, twalk -- manipulate binary search trees
SYNOPSIS
#include <search.h>
void *
tdelete(const void * restrict key, void ** restrict rootp, int (*compar) (const void *, const void *));
void *
tfind(const void *key, void * const *rootp, int (*compar) (const void *, const void *));
void *
tsearch(const void *key, void **rootp, int (*compar) (const void *, const void *));
void
twalk(const void *root, void (*action) (const void *, VISIT, int));
DESCRIPTION
The tdelete(), tfind(), tsearch(), and twalk() functions manage binary search trees based on algorithms T and D from Knuth (6.2.2). The com-
parison function passed in by the user has the same style of return values as strcmp(3).
The tfind() function searches for the datum matched by the argument key in the binary tree rooted at rootp, returning a pointer to the datum
if it is found and NULL if it is not.
The tsearch() function is identical to tfind() except that if no match is found, key is inserted into the tree and a pointer to it is
returned. If rootp points to a NULL value a new binary search tree is created.
The tdelete() function deletes a node from the specified binary search tree and returns a pointer to the parent of the node to be deleted.
It takes the same arguments as tfind() and tsearch(). If the node to be deleted is the root of the binary search tree, rootp will be
adjusted.
The twalk() function walks the binary search tree rooted in root and calls the function action on each node. The action function is called
with three arguments: a pointer to the current node, a value from the enum typedef enum { preorder, postorder, endorder, leaf } VISIT; speci-
fying the traversal type, and a node level (where level zero is the root of the tree).
RETURN VALUES
The tsearch() function returns NULL if allocation of a new node fails (usually due to a lack of free memory).
The tfind(), tsearch(), and tdelete() functions return NULL if rootp is NULL or the datum cannot be found.
The twalk() function returns no value.
SEE ALSO
bsearch(3), hsearch(3), lsearch(3)
BSD
June 15, 1997 BSD