g_tree_insert overwrites all data

Posted by pechenie on Stack Overflow See other posts from Stack Overflow or by pechenie
Published on 2010-03-23T05:50:08Z Indexed on 2010/03/23 5:53 UTC
Read the original article Hit count: 244

Filed under:

bst

|

binary-trees

|

overwrite

I wonder how I should use the GTree (from GLib) to store data? Every new value I insert into GTree with g_tree_insert routine is overwrite the previous one!

GTree *tree; //init
tree = g_tree_new( g_str_equal ); //"g_str_equal" is a GLib default compare func
//...
for( i = 0; i < 100; ++i )
    g_tree_insert( tree, random_key(), random_value() ); //insert some random vals
//
printf( "%d", g_tree_nnodes( tree ) ); //should be 100? NO! Prints "1"!!!

What am I doing wrong? Thank you.

© Stack Overflow or respective owner

Related posts about bst

Balanced Binary Search Tree (BST) (Search, PrintInOrder, PrintPreOrder, PrintPostOrder,DepthFirst, B

as seen on Code Project - Search for 'Code Project'
Balanced Binary Search Tree (BST) (Search, PrintInOrder, PrintPreOrder, PrintPostOrder,DepthFirst, BreadthFirst, BalanceTree) >>> More
Exporting a non public Type through public API

as seen on Stack Overflow - Search for 'Stack Overflow'
I am trying to follow Trees tutorial at: http://cslibrary.stanford.edu/110/BinaryTrees.html Here is the code I have written so far: package trees.bst; import java.util.ArrayList; import java.util.List; import java.util.StringTokenizer; /** * * @author sachin */ public class BinarySearchTree… >>> More
Twitter Oauth GMT / BST problem

as seen on Stack Overflow - Search for 'Stack Overflow'
I keep getting 401 when trying to login via Oauth with Twitter. I'm using twitter_oauth-0.3.3 with oauth-0.3.6 in rails It used to work perfectly some time ago, so after some digging, I realised it might have something to do with my timezone. In the headers of the Twitter response, one of them… >>> More
build a bst as an array using recursion?

as seen on Stack Overflow - Search for 'Stack Overflow'
String[] dictionary = new String[dictSize]; //arrray of strings from dictionary String[] tree = new String[3*dictSize]; //array of tree void makeBST() { recMakeBST(0, dictionary.length-1); }//makeBST() int a=0; void recMakeBST(int low, int high) { if(high-low==0){ return; … >>> More
How to Implement BST in Python

as seen on Stack Overflow - Search for 'Stack Overflow'
Which is the best data structure that can be used to implement Binary Search Tree in Python? >>> More

Related posts about binary-trees

Binary Trees in Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider the following BNF defining trees of numbers. Notice that a tree can either be a leaf, a node-1 with one subtrees, or a node-2 with two subtrees. tree ::= (’leaf number) | (’node-1 tree) | (’node-2 tree tree) a. Write a template for recursive procedures on these trees. b. Define the procedure… >>> More
C++ design question on traversing binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a binary tree T which I would like to copy to another tree. Suppose I have a visit method that gets evaluated at every node: struct visit { virtual void operator() (node* n)=0; }; and I have a visitor algorithm void visitor(node* t, visit& v) { //do a preorder traversal using… >>> More
Priority queues and Binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to create a game using priority queues and binary tree, for example a solitaire game. I hope this is not to vague? >>> More
What are the applications of binary trees?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am wondering what the particular applications of binary trees are. Could you give some real examples? Thanks. >>> More
A deque based on binary trees

as seen on Programmers - Search for 'Programmers'
This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different… >>> More