I am trying to write a program in Common Lisp using GNU ClISP to c开发者_JS百科ompile it. I would like to enter a list such as (A(B (C) ()) (D (E) (F (G) ()))) and depending on the first word print ou
I have the following code: #include <iostream> using namespace std; class BST{ public: int n,*v,vn; struct node {
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
I want to store the following input in a tree such that a number (lets call it x) at level i has two children at level i+1, one is just below x and the other one is one position right to the node just
I have a large tree that grows as my algorithm progresses.Each node contains set, which I suppose is implemented as balanced binary search tree.Each node\'s set shall remain fixed after that node\'s c
I have seen array based implementations of static binary trees which do not waste memory for pointers and instead do operations on the current index to go to its parent or children. Is there any artic
I\'m wondering if its possible to have an inorder tree traversal method in java actually RETURN something... I\'m trying to traverse through the tree given a node and a value, return the node that mat
I\'m having a pretty confusing problem in building a binary tree. Apparently this should be an easy task but somehow I may mess up with the pointers in it.
I\'m having trouble with swapping nodes between two binary trees. I\'m trying to swap the current node with the passed node in the tree, but I can\'t figure out how; I can only seem to swap the paren
I read about binary search trees that if it is a complete tree (all nodes except leaf nodes have two children) having n nodes, then no path can have more than 1+log n nodes.
加载中,请稍侯......