binary-search-tree

问题 I'm implementing an algorithm to do directory matching. So I'm given a set of valid paths that can include wildcards (denoted by "X"). Then when I pass in an input I need to know if that input matches with one of the paths in my valid set. I'm running into a problem with the wildcards when a wildcard value that is passed in actually matches with another valid value. Here is an example: Set of valid paths: /guest /guest/X /X/guest /member /member/friends /member/X /member/X/friends Example

问题 BCL has introduced a group of Immutable Collections I am wondering what's the difference between ImmutableSortedSet and the native FSharp Set ? It seems that the performance signatures of both are similar. Also I saw somewhere that SortedSet is implemented as a Red Black Tree, so I guess ImmutableSortedSet does the same. What is the internal implementation of fsharp map ? Is is Red Black Tree as claimed here or AVL tree as found out here? In addition, why MSDN documents don't state clear what

问题 BCL has introduced a group of Immutable Collections I am wondering what's the difference between ImmutableSortedSet and the native FSharp Set ? It seems that the performance signatures of both are similar. Also I saw somewhere that SortedSet is implemented as a Red Black Tree, so I guess ImmutableSortedSet does the same. What is the internal implementation of fsharp map ? Is is Red Black Tree as claimed here or AVL tree as found out here? In addition, why MSDN documents don't state clear what

问题 So I want to pass a pointer to a function and have that function modify that pointer from inside that function. How do i do that in general? In here? EDIT: Since the treeNode is a struct of pointers I want to take nodePtr->vendorDataRef inside of the removeLeftMostNode(...) function and somehow get it back to the calling function. I thought I could do this through a parameter of removeLeftMostNode(...) hence removeLeftMostNode(...aVendor* vendorDataRef) i.e. aBst::treeNode * aBst::removeNode

问题 I am trying to insert node in a binary search tree, I am getting an access voilation error at line if(ptr->data== item) in searchNode() function. How can I remove it. I am new to debugging. I am first trying to insert few nodes and then display them using display function. During insertion the program searches for the appropriate position of the node to be inserted and then inserts it. Program simply returns if node already exists. #include<stdio.h> #include<conio.h> #include<stdlib.h> struct

问题 The problem I am tackle with is to find the first occurrence node in its inorder traversal in a BST. The code I have is given below def Inorder_search_recursive(node,key): if not node: return None InOrder_search_recursive(node.lChild) if node.value==key: return node InOrder_search_recursive(node.rChild) This code always return None, what's wrong with it. I think I've return node when I find a node with value k. Why cannot python pass this node???Thanks in advance 回答1: When you call yourself

问题 Ok, I have written a binary search tree in OCaml. type 'a bstree = |Node of 'a * 'a bstree * 'a bstree |Leaf let rec insert x = function |Leaf -> Node (x, Leaf, Leaf) |Node (y, left, right) as node -> if x < y then Node (y, insert x left, right) else if x > y then Node (y, left, insert x right) else node The above code was said to be good in The right way to use a data structure in OCaml However, I found a problem. This insert will only work when building a bst from a list in one go, such as

问题 I'm writing a code to return the parent of any node, but I'm getting stuck. I don't want to use any predefined ADTs. //Assume that nodes are represented by numbers from 1...n where 1=root and even //nos.=left child and odd nos=right child. public int parent(Node node){ if (node % 2 == 0){ if (root.left==node) return root; else return parent(root.left); } //same case for right } But this program is not working and giving wrong results. My basic algorithm is that the program starts from the

问题 I'm writing a code to return the parent of any node, but I'm getting stuck. I don't want to use any predefined ADTs. //Assume that nodes are represented by numbers from 1...n where 1=root and even //nos.=left child and odd nos=right child. public int parent(Node node){ if (node % 2 == 0){ if (root.left==node) return root; else return parent(root.left); } //same case for right } But this program is not working and giving wrong results. My basic algorithm is that the program starts from the

问题 I have built a splay tree and I am trying to print it out reverse in order so that when you turn your head to the left you can see the tree in a normal manner. I have written the following code and it outputs the tree somewhat correctly but it adds extra spaces in on the rightmost node and it doesn't add spaces for all of the child nodes that should be placed below the root node: public void printReverseInOrder() { if (root != null) { reverseInOrder(root, 0); } else { System.out.println(); }