Search Results

Search found 7638 results on 306 pages for 'binary tree'.

Page 1/306 | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

• How to Serialize Binary Tree

  - by Veljko Skarich

  I went to an interview today where I was asked to serialize a binary tree. I implemented an array-based approach where the children of node i (numbering in level-order traversal) were at the 2*i index for the left child and 2*i + 1 for the right child. The interviewer seemed more or less pleased, but I'm wondering what serialize means exactly?…

  Read the article

• Silverlight Tree View with Multiple Levels

  - by psheriff

  There are many examples of the Silverlight Tree View that you will find on the web, however, most of them only show you how to go to two levels. What if you have more than two levels? This is where understanding exactly how the Hierarchical Data Templates works is vital. In this blog post, I am going to break down how these templates work so…

  Read the article

• AVL tree vs. B-tree

  - by Phenom

  How is an AVL tree different from a B-tree?

  Read the article

• Finding if a Binary Tree is a Binary Search Tree

  - by dharam

  Today I had an interview where I was asked to write a program which takes a Binary Tree and returns true if it is also a Binary Search Tree otherwise false. My Approach1: Perform an inroder traversal and store the elements in O(n) time. Now scan through the array/list of elements and check if element at ith index is greater than element at…

  Read the article

• New to AVL tree implementation.

  - by nn

  I am writing a sliding window compression algorithm (LZ77) that searches for phrases in a "moving" dictionary. So far I have written a BST where each node is stored in an array and it's index in the array is also the value of the starting position in the window itself. I am now looking at transforming the BST to an AVL tree. I am a little…

  Read the article

• Insert Record by Drag & Drop from ADF Tree to ADF Tree Table

  - by arul.wilson(at)oracle.com

  If you want to create record based on the values Dragged from ADF Tree and Dropped on a ADF Tree Table, then here you go.UseCase DescriptionUser Drags a tree node from ADF Tree and Drops it on a ADF Tree Table node. A new row gets added in the Tree Table based on the source tree node, subsequently a record gets added to the database table…

  Read the article

• make tree in scheme

  - by ???

  (define (entry tree) (car tree)) (define (left-branch tree) (cadr tree)) (define (right-branch tree) (caddr tree)) (define (make-tree entry left right) (list entry left right)) (define (mktree order items_list) (cond ((= (length items_list) 1) (make-tree (car items_list) '() '())) (else (insert2 order (car…

  Read the article

• Can't find a Windows Explorer alternative that has FULL-TREE View

  - by samJL

  I cannot find a Windows Explorer alternative that has full-tree view functionality like Path Finder on the Mac This is the type of view I am looking for (screenshot of Path Finder on Mac): By full-tree I mean: A tree view that includes files in addition to folders, and can be operated as its own pane-- not as a shared pane or…

  Read the article

• Figuring a max repetitive sub-tree in an object tree

  - by bonomo

  I am trying to solve a problem of finding a max repetitive sub-tree in an object tree. By the object tree I mean a tree where each leaf and node has a name. Each leaf has a type and a value of that type associated with that leaf. Each node has a set of leaves / nodes in certain order. Given an object tree that - we know - has a…

  Read the article

• Unit testing to prove balanced tree

  - by Darrel Hoffman

  I've just built a self-balancing tree (red-black) in Java (language should be irrelevant for this question though), and I'm trying to come up with a good means of testing that it's properly balanced. I've tested all the basic tree operations, but I can't think of a way to test that it is indeed well and truly balanced. I've…

  Read the article

• With ' N ' no of nodes, how many different Binary and Binary Search Trees possible ?

  - by siva

  For Binary tree: You no need to consider tree node values, I am interested about different tree topologies with 'N' nodes. For Binary Search Tree: We obviously consider tree node values.

  Read the article

• In-order tree traversal

  - by Chris S

  I have the following text from an academic course I took a while ago about in-order traversal (they also call it pancaking) of a binary tree (not BST): In-order tree traversal Draw a line around the outside of the tree. Start to the left of the root, and go around the outside of the tree, to end up to the right of…

  Read the article

• Nicely printing/showing a binary tree in Haskell

  - by nicole

  I have a tree data type: data Tree a b = Branch b (Tree a b) (Tree a b) | Leaf a ...and I need to make it an instance of Show, without using deriving. I have found that nicely displaying a little branch with two leaves is easy: instance (Show a, Show b) => Show (Tree a b) where show (Leaf x) = show x show…

  Read the article

• Max Value of a Multiway Tree in OCaml

  - by Trigork

  I'm an IT Student and kind of a newbie to OCaml Recently, studying for an exam I found this exercise. Given: type 'a tree = Tree of 'a * 'a tree list Define a function mtree : 'a tree -'a, that returns the greatest value of all the nodes in a multiway tree, following the usual order relation in OCaml (<=) I've…

  Read the article

• Paged binary trees vs. AVL trees and B-trees

  - by Phenom

  How are paged binary trees different from AVL trees and B-trees?

  Read the article

• HP to Cisco spanning tree root flapping

  - by Tim Brigham

  Per a recent question I recently configured both my HP (2x 2900) and Cisco (1x 3750) hardware to use MSTP for interoperability. I thought this was functional until I applied the change to the third device (HP switch 1 below) at which time the spanning tree root started flapping causing performance issues (5% packet…

  Read the article

• Binary to strings as binary? C #/.NET

  - by acidzombie24

  Redis keys are binary safe. I'd like to mess around and put binary into redis using C#. My client of choice doesn't support writing binary keys it uses keys and it make sense. However i am just fooling around so tell me how i can do this. How do i convert a raw byte[] into a string? At first i was thinking about…

  Read the article

• check if a tree is a binary search tree

  - by TimeToCodeTheRoad

  I have written the following code to check if a tree is a Binary search tree. Please help me check the code: Pair p{ boolean isTrue; int min; int max; } public boo lean isBst(BNode v){ return isBST1(v).isTrue; } public Pair isBST1(BNode v){ if(v==null) return new Pair(true,…

  Read the article

• drawing hierarchical tree with orthogonal lines ( HV-Drawing – Binary Tree)

  - by user267530

  Hi I need to work on drawing a hierarchical tree structure (HV-Drawing – Binary Tree) with orthogonal lines(straight rectangular connecting lines) between root and children ( like the following: http://lab.kapit.fr/display/visualizationlayouts/Hierarchical+Tree+layout ). I want to know if there are any open…

  Read the article

• Interval tree algorithm that supports merging of intervals with no overlap

  - by Dave Griffiths

  I'm looking for an interval tree algorithm similar to the red-black interval tree in CLR but that supports merging of intervals by default so that there are never any overlapping intervals. In other words if you had a tree containing two intervals [2,3] and [5,6] and you added the interval [4,4], the…

  Read the article

• Are there any B-tree programs or sites that show visually how a B-tree works

  - by Phenom

  I found this website that lets you insert and delete items from a B-tree and shows you visually what the B-tree looks like: java b-tree I'm looking for another website or program similar to this. This site does not allow you to specify a B-tree of order 4 (4 pointers and 3 elements), it only lets…

  Read the article

• Why we do not use PowerConnect to access PeopleSoft Tree

  - by dylan.wan

  1. It does not allow you to use parameters to the PeopleSoft connect. It may be changed later. However, it was a big issue when we try to address customer issues. 2. It requires EFFDT as an option. It expect that people change the EFFDT using Mapping Editor. How can a business user does that…

  Read the article

• Generated 3d tree meshes

  - by Jari Komppa

  I did not find a question on these lines yet, correct me if I'm wrong. Trees (and fauna in general) are common in games. Due to their nature, they are a good candidate for procedural generation. There's SpeedTree, of course, if you can afford it; as far as I can tell, it doesn't provide the…

  Read the article

• apt-get update error - binary-i386, binary-amd64 [duplicate]

  - by magamig

  This question already has an answer here: How can I fix a 404 Error when updating packages? 5 answers When I run: sudo apt-get update It shows me the following error: W: Failed…

  Read the article

• Behavior tree implementation details

  - by angryInsomniac

  I have been looking around for implementation details of behavior trees, the best descriptions I found were by Alex Champarand and some of Damian Isla's talk about AI in Halo 2 (the video of which is locked up in the GDC vault sadly). However, both descriptions fall short of helping one…

  Read the article

1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >