08-11-2005
10 More Discussions You Might Find Interesting
1. 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
2. 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
3. Shell Programming and Scripting
Hey,
I'm working on a file traversal and extraction function and am having problems.
So, my script is finding all files in a directory. Each file has the same format. I need to extract a field from the 4th line of each file..... hence why I am using the substring on NR == 4. So, I am... (11 Replies)
Discussion started by: beefeater267
11 Replies
4. Shell Programming and Scripting
Hi all,
I'd like to create a directory tree, and define from stdin how many levels deep and how many directories in each level should be created.
What I wrote does not work properly:#!/bin/bash
#set -x
read -p " What root directory? " rootDir
&& { /bin/rm -R $rootDir; mkdir $rootDir; } ||... (2 Replies)
Discussion started by: NBaH
2 Replies
5. Programming
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? (5 Replies)
Discussion started by: sepoto
5 Replies
6. Shell Programming and Scripting
Hi Experts,
I have table in mysql like below:
'user` (
`user_id` int(11) NOT NULL AUTO_INCREMENT,
`parent_id`
varchar(100) NOT NULL,
`member_name` varchar(100) NOT NULL,
`city` varchar(100) NOT NULL,
`member_id` varchar(100) NOT
NULL,
`password` varchar(100) NOT... (1 Reply)
Discussion started by: naw_deepak
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
Hi,
I have to get some value of the from a flat file and my file format is like this.
ABC
DEF
HIJ=1
XYZ
xyz
HIJ=2
So i need to make sure i get all the value of HIJ under XYZ and not ABC. (4 Replies)
Discussion started by: nidhink
4 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 MOJAVE
tdelete
TSEARCH(3) BSD Library Functions Manual TSEARCH(3)
NAME
tdelete, tfind, tsearch, twalk -- manipulate binary search trees
SYNOPSIS
#include <search.h>
void *
tdelete(const void *restrict key, void **restrict rootp, int (*compar) (const void *key1, const void *key2));
void *
tfind(const void *key, void *const *rootp, int (*compar) (const void *key1, const void *key2));
void *
tsearch(const void *key, void **rootp, int (*compar) (const void *key1, const void *key2));
void
twalk(const void *root, void (*action) (const void *node, VISIT order, int level));
DESCRIPTION
The tdelete(), tfind(), tsearch(), and twalk() functions manage binary search trees, based on algorithms T and D from Knuth (6.2.2). The
comparison function passed in by the user takes two arguments, each of which is a key pointer. This function has the same style of return
values as strcmp(3).
The tfind() function searches for a node whose key matches the argument key in the binary tree rooted at rootp, returning a pointer to the
node if it is found and NULL if it is not.
Note that a node is itself a pointer to the key of the node. Thus, you should generally cast this result to a double pointer to the data
type stored in the tree, for example (struct myType **), and use double indirection to retrieve the original key value.
The tsearch() function is identical to tfind() except that, if no match is found, it inserts a new node for the key into the tree and returns
a pointer to the node. 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 that was 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).
As twalk() traverses the tree, it calls the action function with the traversal type "preorder" before visiting the left subtree of the node,
with the traversal type "postorder" before visiting the right subtree of the node, and with the traversal type "endorder" after visiting the
right subtree of the node. The action function is called only once for a leaf-node, with the traversal type "leaf."
Note: the names for the traversal types differ somewhat from common parlance. The traversal type "postorder" corresponds to what would typi-
cally be referred to as in-order, and the traversal type "endorder" corresponds to what would typically be referred to as post-order.
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 node cannot be found.
The twalk() function returns no value.
SEE ALSO
bsearch(3), hsearch(3), lsearch(3)
BSD
June 15, 1997 BSD